/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:07:44,647 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:07:44,649 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:07:44,683 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:07:44,684 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:07:44,685 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:07:44,687 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:07:44,689 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:07:44,690 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:07:44,693 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:07:44,694 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:07:44,695 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:07:44,695 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:07:44,697 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:07:44,698 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:07:44,700 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:07:44,700 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:07:44,701 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:07:44,702 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:07:44,706 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:07:44,707 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:07:44,708 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:07:44,709 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:07:44,709 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:07:44,710 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:07:44,715 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:07:44,715 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:07:44,715 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:07:44,716 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:07:44,716 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:07:44,717 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:07:44,717 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:07:44,718 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:07:44,719 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:07:44,719 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:07:44,720 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:07:44,720 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:07:44,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:07:44,720 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:07:44,720 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:07:44,721 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:07:44,722 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:07:44,723 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:07:44,729 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:07:44,730 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:07:44,731 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:07:44,731 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:07:44,731 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:07:44,731 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:07:44,731 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:07:44,731 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:07:44,732 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:07:44,732 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:07:44,732 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:07:44,732 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:07:44,732 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:07:44,733 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:44,733 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:07:44,733 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:07:44,734 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:07:44,734 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:07:44,734 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 07:07:44,923 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:07:44,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:07:44,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:07:44,941 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:07:44,942 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:07:44,942 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-15 07:07:44,983 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422922ac9/2ff16f0a8bb7494da03642a4d41902cb/FLAGadcd7180f [2022-04-15 07:07:45,292 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:07:45,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-15 07:07:45,297 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422922ac9/2ff16f0a8bb7494da03642a4d41902cb/FLAGadcd7180f [2022-04-15 07:07:45,719 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/422922ac9/2ff16f0a8bb7494da03642a4d41902cb [2022-04-15 07:07:45,721 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:07:45,721 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:07:45,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:45,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:07:45,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:07:45,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,731 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1cfa0c79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45, skipping insertion in model container [2022-04-15 07:07:45,731 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,736 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:07:45,756 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:07:45,888 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_3.c[784,797] [2022-04-15 07:07:45,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:45,895 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:07:45,909 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_3.c[784,797] [2022-04-15 07:07:45,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:45,919 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:07:45,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45 WrapperNode [2022-04-15 07:07:45,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:45,920 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:07:45,920 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:07:45,920 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:07:45,928 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,928 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,932 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,932 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,935 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,937 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,938 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,939 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:07:45,939 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:07:45,939 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:07:45,939 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:07:45,941 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (1/1) ... [2022-04-15 07:07:45,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:45,977 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 07:07:46,001 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:07:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:07:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:07:46,002 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:07:46,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:07:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:07:46,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:07:45,992 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 07:07:46,049 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:07:46,050 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:07:46,179 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:07:46,183 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:07:46,184 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 07:07:46,185 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:46 BoogieIcfgContainer [2022-04-15 07:07:46,185 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:07:46,186 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:07:46,186 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:07:46,201 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:07:46,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:07:45" (1/3) ... [2022-04-15 07:07:46,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a30ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:46, skipping insertion in model container [2022-04-15 07:07:46,202 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:45" (2/3) ... [2022-04-15 07:07:46,202 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b4a30ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:46, skipping insertion in model container [2022-04-15 07:07:46,203 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:46" (3/3) ... [2022-04-15 07:07:46,203 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-15 07:07:46,206 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:07:46,207 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:07:46,273 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:07:46,278 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 07:07:46,278 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:07:46,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 07:07:46,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:46,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:46,303 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:46,303 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:46,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-15 07:07:46,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:46,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1590344382] [2022-04-15 07:07:46,335 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:46,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-15 07:07:46,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:46,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470133838] [2022-04-15 07:07:46,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:46,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:46,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:46,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23#true} is VALID [2022-04-15 07:07:46,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:07:46,511 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-15 07:07:46,515 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:46,515 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23#true} is VALID [2022-04-15 07:07:46,516 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-15 07:07:46,516 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-15 07:07:46,516 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-15 07:07:46,516 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {23#true} is VALID [2022-04-15 07:07:46,517 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-15 07:07:46,517 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-15 07:07:46,518 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-15 07:07:46,518 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 07:07:46,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:46,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470133838] [2022-04-15 07:07:46,520 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470133838] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:46,520 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:46,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:46,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:46,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1590344382] [2022-04-15 07:07:46,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1590344382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:46,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:46,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:46,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058342040] [2022-04-15 07:07:46,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:46,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,532 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:46,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,548 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 07:07:46,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:07:46,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:46,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:07:46,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:07:46,569 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,643 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-15 07:07:46,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:07:46,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:46,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-15 07:07:46,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-15 07:07:46,659 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-15 07:07:46,708 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 07:07:46,713 INFO L225 Difference]: With dead ends: 34 [2022-04-15 07:07:46,714 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 07:07:46,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:07:46,719 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:46,721 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:46,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 07:07:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 07:07:46,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:46,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 07:07:46,746 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 07:07:46,746 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 07:07:46,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,750 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 07:07:46,750 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 07:07:46,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:46,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:46,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 15 states. [2022-04-15 07:07:46,752 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 15 states. [2022-04-15 07:07:46,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,753 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-15 07:07:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 07:07:46,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:46,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:46,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:46,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:46,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 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 07:07:46,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-15 07:07:46,756 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-15 07:07:46,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:46,756 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-15 07:07:46,756 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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 07:07:46,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-15 07:07:46,775 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-15 07:07:46,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:46,776 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:46,776 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:46,776 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:07:46,778 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-15 07:07:46,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:46,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2027095426] [2022-04-15 07:07:46,779 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:46,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-15 07:07:46,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:46,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767428819] [2022-04-15 07:07:46,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:46,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:46,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:46,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:46,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:46,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {159#true} is VALID [2022-04-15 07:07:46,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 07:07:46,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-15 07:07:46,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:46,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {159#true} is VALID [2022-04-15 07:07:46,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-15 07:07:46,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-15 07:07:46,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-15 07:07:46,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {164#(= main_~a~0 0)} is VALID [2022-04-15 07:07:46,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-15 07:07:46,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-15 07:07:46,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-15 07:07:46,846 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 07:07:46,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:46,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767428819] [2022-04-15 07:07:46,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767428819] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:46,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:46,847 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:46,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2027095426] [2022-04-15 07:07:46,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2027095426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:46,847 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:46,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:46,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702773058] [2022-04-15 07:07:46,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:46,848 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 07:07:46,848 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:46,848 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 07:07:46,856 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 07:07:46,856 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:07:46,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:46,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:07:46,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:07:46,857 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. 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 07:07:46,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,914 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-15 07:07:46,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:07:46,914 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 07:07:46,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:46,914 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 07:07:46,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 07:07:46,915 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 07:07:46,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-15 07:07:46,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-15 07:07:46,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:46,959 INFO L225 Difference]: With dead ends: 24 [2022-04-15 07:07:46,959 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 07:07:46,960 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 07:07:46,961 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:46,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:46,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 07:07:46,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-15 07:07:46,964 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:46,964 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 07:07:46,964 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 07:07:46,964 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 07:07:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,965 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-15 07:07:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 07:07:46,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:46,966 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:46,966 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 21 states. [2022-04-15 07:07:46,966 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 21 states. [2022-04-15 07:07:46,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:46,967 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-15 07:07:46,967 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-15 07:07:46,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:46,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:46,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:46,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:46,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 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 07:07:46,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-15 07:07:46,968 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-15 07:07:46,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:46,969 INFO L478 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-15 07:07:46,969 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 07:07:46,969 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-15 07:07:46,983 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 07:07:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-15 07:07:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:07:46,984 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:46,984 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:46,984 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:07:46,984 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:46,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:46,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-15 07:07:46,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:46,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [961726976] [2022-04-15 07:07:47,044 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:47,045 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:47,046 INFO L85 PathProgramCache]: Analyzing trace with hash 1694000335, now seen corresponding path program 1 times [2022-04-15 07:07:47,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:47,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394219233] [2022-04-15 07:07:47,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:47,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:47,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:47,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:47,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:47,085 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {292#true} is VALID [2022-04-15 07:07:47,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:07:47,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-15 07:07:47,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:47,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {292#true} is VALID [2022-04-15 07:07:47,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-15 07:07:47,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-15 07:07:47,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret7 := main(); {292#true} is VALID [2022-04-15 07:07:47,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {297#(= main_~a~0 0)} is VALID [2022-04-15 07:07:47,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {297#(= main_~a~0 0)} [60] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (= v_main_~b~0_10 v_main_~b~0_9) .cse0 (= v_main_~a~0_10 v_main_~a~0_9)) (and (= v_main_~b~0_9 v_main_~b~0_10) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)))) InVars {main_~b~0=v_main_~b~0_10, main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_~b~0=v_main_~b~0_9, main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {297#(= main_~a~0 0)} is VALID [2022-04-15 07:07:47,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~a~0 0)} [59] L21-4_primed-->L21-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[] {293#false} is VALID [2022-04-15 07:07:47,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {293#false} is VALID [2022-04-15 07:07:47,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-15 07:07:47,088 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 07:07:47,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:47,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394219233] [2022-04-15 07:07:47,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394219233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:47,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:47,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:47,103 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:47,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [961726976] [2022-04-15 07:07:47,104 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [961726976] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:47,104 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:47,104 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:07:47,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914795087] [2022-04-15 07:07:47,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:47,104 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:47,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,113 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 07:07:47,113 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:07:47,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:47,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:07:47,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:07:47,114 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 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 07:07:47,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,186 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-15 07:07:47,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:07:47,186 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:47,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 07:07:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-15 07:07:47,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-15 07:07:47,220 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 07:07:47,223 INFO L225 Difference]: With dead ends: 34 [2022-04-15 07:07:47,223 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 07:07:47,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:07:47,226 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:47,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:47,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 07:07:47,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-04-15 07:07:47,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:47,235 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 07:07:47,235 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 07:07:47,236 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 07:07:47,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,237 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 07:07:47,237 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 07:07:47,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:47,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:47,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 25 states. [2022-04-15 07:07:47,239 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 25 states. [2022-04-15 07:07:47,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,243 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-15 07:07:47,243 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 07:07:47,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:47,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:47,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:47,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:47,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 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 07:07:47,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-15 07:07:47,246 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-15 07:07:47,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:47,246 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-15 07:07:47,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 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 07:07:47,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-15 07:07:47,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:47,263 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-15 07:07:47,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 07:07:47,264 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:47,264 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:47,264 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:07:47,265 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:47,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:47,266 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 1 times [2022-04-15 07:07:47,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:47,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [949832427] [2022-04-15 07:07:47,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:47,373 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:47,374 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:47,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1694061839, now seen corresponding path program 1 times [2022-04-15 07:07:47,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:47,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419519285] [2022-04-15 07:07:47,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:47,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:47,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:47,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:47,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:47,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {458#true} is VALID [2022-04-15 07:07:47,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-15 07:07:47,421 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #56#return; {458#true} is VALID [2022-04-15 07:07:47,422 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:47,422 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {458#true} is VALID [2022-04-15 07:07:47,422 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-15 07:07:47,422 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #56#return; {458#true} is VALID [2022-04-15 07:07:47,422 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret7 := main(); {458#true} is VALID [2022-04-15 07:07:47,423 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {463#(= main_~a~0 0)} is VALID [2022-04-15 07:07:47,423 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(= main_~a~0 0)} [62] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|)) (.cse1 (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|)) (.cse2 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse3 (= v_main_~b~0_23 v_main_~b~0_21))) (or (and .cse0 (= v_main_~c~0_16 v_main_~c~0_15) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_15 v_main_~c~0_16) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_16, main_~b~0=v_main_~b~0_23, main_#t~pre4=|v_main_#t~pre4_9|, main_#t~pre5=|v_main_#t~pre5_10|, main_~a~0=v_main_~a~0_16} OutVars{main_~c~0=v_main_~c~0_15, main_~b~0=v_main_~b~0_21, main_#t~pre4=|v_main_#t~pre4_8|, main_#t~pre5=|v_main_#t~pre5_9|, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {463#(= main_~a~0 0)} is VALID [2022-04-15 07:07:47,424 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(= main_~a~0 0)} [61] L21-4_primed-->L21-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[] {459#false} is VALID [2022-04-15 07:07:47,424 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {459#false} is VALID [2022-04-15 07:07:47,424 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-15 07:07:47,424 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 07:07:47,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:47,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419519285] [2022-04-15 07:07:47,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419519285] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:47,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:47,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:47,447 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:47,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [949832427] [2022-04-15 07:07:47,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [949832427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:47,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:47,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:07:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316361290] [2022-04-15 07:07:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:47,448 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-04-15 07:07:47,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:47,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:47,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:47,458 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:07:47,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:47,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:07:47,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:07:47,459 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,546 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 07:07:47,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:07:47,546 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 15 [2022-04-15 07:07:47,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:47,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:47,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:07:47,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:47,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-15 07:07:47,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-15 07:07:47,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:47,578 INFO L225 Difference]: With dead ends: 36 [2022-04-15 07:07:47,578 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 07:07:47,578 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:07:47,579 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:47,579 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:47,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 07:07:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2022-04-15 07:07:47,581 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:47,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 07:07:47,582 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 07:07:47,582 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 07:07:47,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,583 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 07:07:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 07:07:47,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:47,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:47,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 27 states. [2022-04-15 07:07:47,583 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 27 states. [2022-04-15 07:07:47,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:47,584 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 07:07:47,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 07:07:47,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:47,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:47,585 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:47,585 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 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 07:07:47,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 07:07:47,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-15 07:07:47,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:47,586 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 07:07:47,586 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 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 07:07:47,586 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 07:07:47,608 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 07:07:47,608 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 07:07:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 07:07:47,609 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:47,609 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:47,610 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:07:47,610 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:47,610 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 1 times [2022-04-15 07:07:47,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:47,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1781363850] [2022-04-15 07:07:47,763 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:47,897 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:47,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:48,014 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:48,015 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:48,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1694123343, now seen corresponding path program 1 times [2022-04-15 07:07:48,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:48,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581352231] [2022-04-15 07:07:48,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:48,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:48,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:48,066 INFO L290 TraceCheckUtils]: 0: Hoare triple {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {637#true} is VALID [2022-04-15 07:07:48,066 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2022-04-15 07:07:48,067 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #56#return; {637#true} is VALID [2022-04-15 07:07:48,068 INFO L272 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:48,068 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {637#true} is VALID [2022-04-15 07:07:48,068 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#true} assume true; {637#true} is VALID [2022-04-15 07:07:48,068 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {637#true} {637#true} #56#return; {637#true} is VALID [2022-04-15 07:07:48,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {637#true} call #t~ret7 := main(); {637#true} is VALID [2022-04-15 07:07:48,071 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {642#(= main_~a~0 0)} is VALID [2022-04-15 07:07:48,071 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#(= main_~a~0 0)} [64] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_36 v_main_~b~0_34) (= |v_main_#t~pre5_21| |v_main_#t~pre5_20|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre6_21| |v_main_#t~pre6_20|) (= v_main_~c~0_41 v_main_~c~0_39) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|)) InVars {main_~c~0=v_main_~c~0_41, main_~b~0=v_main_~b~0_36, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_21|} OutVars{main_~c~0=v_main_~c~0_39, main_~b~0=v_main_~b~0_34, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_20|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_20|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {642#(= main_~a~0 0)} is VALID [2022-04-15 07:07:48,072 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(= main_~a~0 0)} [63] L21-4_primed-->L21-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[] {638#false} is VALID [2022-04-15 07:07:48,072 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {638#false} is VALID [2022-04-15 07:07:48,072 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-04-15 07:07:48,072 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 07:07:48,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:48,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581352231] [2022-04-15 07:07:48,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581352231] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:48,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:48,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:48,108 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:48,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1781363850] [2022-04-15 07:07:48,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1781363850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:48,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:48,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:07:48,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248730968] [2022-04-15 07:07:48,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:48,109 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 17 [2022-04-15 07:07:48,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:48,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 07:07:48,122 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:48,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:07:48,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:48,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:07:48,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:07:48,123 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 07:07:48,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:48,244 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-15 07:07:48,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:07:48,244 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 17 [2022-04-15 07:07:48,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:48,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 07:07:48,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:07:48,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 07:07:48,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-15 07:07:48,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-15 07:07:48,270 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 07:07:48,271 INFO L225 Difference]: With dead ends: 38 [2022-04-15 07:07:48,271 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 07:07:48,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:07:48,272 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:48,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:48,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 07:07:48,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-04-15 07:07:48,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:48,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 07:07:48,275 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 07:07:48,275 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 07:07:48,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:48,276 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 07:07:48,276 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 07:07:48,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:48,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:48,276 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 29 states. [2022-04-15 07:07:48,277 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 29 states. [2022-04-15 07:07:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:48,277 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-15 07:07:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 07:07:48,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:48,278 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:48,278 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:48,278 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:48,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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 07:07:48,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-15 07:07:48,278 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-15 07:07:48,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:48,279 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-15 07:07:48,279 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 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 07:07:48,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-15 07:07:48,305 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 07:07:48,305 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-15 07:07:48,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-15 07:07:48,306 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:48,306 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:48,306 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 07:07:48,306 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:48,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:48,306 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 2 times [2022-04-15 07:07:48,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:48,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1133934563] [2022-04-15 07:07:52,397 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:07:52,517 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:56,607 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:07:56,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:56,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:56,792 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:56,792 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:56,793 INFO L85 PathProgramCache]: Analyzing trace with hash 1694184847, now seen corresponding path program 1 times [2022-04-15 07:07:56,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:56,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498449376] [2022-04-15 07:07:56,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:56,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:56,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:56,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:56,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:56,843 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {831#true} is VALID [2022-04-15 07:07:56,843 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 07:07:56,843 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831#true} {831#true} #56#return; {831#true} is VALID [2022-04-15 07:07:56,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:56,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {831#true} is VALID [2022-04-15 07:07:56,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-15 07:07:56,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #56#return; {831#true} is VALID [2022-04-15 07:07:56,844 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret7 := main(); {831#true} is VALID [2022-04-15 07:07:56,844 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {836#(= main_~a~0 0)} is VALID [2022-04-15 07:07:56,845 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~a~0 0)} [66] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_46| |v_main_#t~pre6_44|)) (.cse1 (= |v_main_#t~pre5_32| |v_main_#t~pre5_31|)) (.cse2 (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|)) (.cse3 (= v_main_~a~0_28 v_main_~a~0_27))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_68 v_main_~c~0_71) (= v_main_~b~0_47 v_main_~b~0_49)) (and .cse0 .cse1 .cse2 (= v_main_~b~0_49 v_main_~b~0_47) .cse3 (= v_main_~c~0_71 v_main_~c~0_68)))) InVars {main_~c~0=v_main_~c~0_71, main_~b~0=v_main_~b~0_49, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_32|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_46|} OutVars{main_~c~0=v_main_~c~0_68, main_~b~0=v_main_~b~0_47, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_31|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_44|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {836#(= main_~a~0 0)} is VALID [2022-04-15 07:07:56,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= main_~a~0 0)} [65] L21-4_primed-->L21-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[] {832#false} is VALID [2022-04-15 07:07:56,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {832#false} is VALID [2022-04-15 07:07:56,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-15 07:07:56,848 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 07:07:56,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:56,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498449376] [2022-04-15 07:07:56,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498449376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:56,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:56,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:56,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:56,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1133934563] [2022-04-15 07:07:56,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1133934563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:56,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:56,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:07:56,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643379450] [2022-04-15 07:07:56,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:56,890 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 19 [2022-04-15 07:07:56,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:56,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:07:56,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:56,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:07:56,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:56,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:07:56,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:07:56,901 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:07:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:57,062 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-15 07:07:57,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:07:57,062 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 19 [2022-04-15 07:07:57,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:07:57,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 07:07:57,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:07:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-15 07:07:57,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-15 07:07:57,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:57,102 INFO L225 Difference]: With dead ends: 40 [2022-04-15 07:07:57,102 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 07:07:57,102 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:07:57,104 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:57,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:07:57,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 07:07:57,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2022-04-15 07:07:57,110 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:57,110 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 07:07:57,110 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 07:07:57,111 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 07:07:57,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:57,112 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 07:07:57,112 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 07:07:57,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:57,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:57,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 31 states. [2022-04-15 07:07:57,113 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 31 states. [2022-04-15 07:07:57,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:57,114 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 07:07:57,114 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 07:07:57,115 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:57,115 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:57,115 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:57,115 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:57,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 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 07:07:57,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-15 07:07:57,118 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-04-15 07:07:57,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:57,118 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-15 07:07:57,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 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 07:07:57,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-15 07:07:57,139 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 07:07:57,140 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-15 07:07:57,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:07:57,141 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:57,141 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:57,141 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 07:07:57,141 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:57,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:57,141 INFO L85 PathProgramCache]: Analyzing trace with hash 517403765, now seen corresponding path program 3 times [2022-04-15 07:07:57,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:57,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1140821150] [2022-04-15 07:07:58,098 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:02,189 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:02,254 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:02,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:02,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:02,377 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:02,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1694246351, now seen corresponding path program 1 times [2022-04-15 07:08:02,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:02,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039964814] [2022-04-15 07:08:02,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:02,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:02,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:02,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:02,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:02,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1040#true} is VALID [2022-04-15 07:08:02,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-15 07:08:02,402 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #56#return; {1040#true} is VALID [2022-04-15 07:08:02,403 INFO L272 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:02,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1040#true} is VALID [2022-04-15 07:08:02,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-15 07:08:02,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1040#true} {1040#true} #56#return; {1040#true} is VALID [2022-04-15 07:08:02,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret7 := main(); {1040#true} is VALID [2022-04-15 07:08:02,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1045#(= main_~a~0 0)} is VALID [2022-04-15 07:08:02,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#(= main_~a~0 0)} [68] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_104 v_main_~c~0_100) (= v_main_~b~0_62 v_main_~b~0_60) (= |v_main_#t~pre6_73| |v_main_#t~pre6_70|) (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|) (= |v_main_#t~pre5_43| |v_main_#t~pre5_42|) (= v_main_~a~0_34 v_main_~a~0_33)) InVars {main_~c~0=v_main_~c~0_104, main_~b~0=v_main_~b~0_62, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_43|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_73|} OutVars{main_~c~0=v_main_~c~0_100, main_~b~0=v_main_~b~0_60, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_42|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_70|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1045#(= main_~a~0 0)} is VALID [2022-04-15 07:08:02,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#(= main_~a~0 0)} [67] L21-4_primed-->L21-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[] {1041#false} is VALID [2022-04-15 07:08:02,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {1041#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1041#false} is VALID [2022-04-15 07:08:02,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2022-04-15 07:08:02,405 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 07:08:02,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:02,405 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039964814] [2022-04-15 07:08:02,405 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039964814] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:02,405 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:02,405 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:02,476 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:02,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1140821150] [2022-04-15 07:08:02,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1140821150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:02,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:02,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:08:02,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114737824] [2022-04-15 07:08:02,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:02,478 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 21 [2022-04-15 07:08:02,478 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:02,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 07:08:02,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:02,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:08:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:02,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:08:02,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:08:02,492 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 07:08:02,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:02,690 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-15 07:08:02,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:08:02,690 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 21 [2022-04-15 07:08:02,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:02,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 07:08:02,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 07:08:02,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 07:08:02,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-15 07:08:02,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-15 07:08:02,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:02,726 INFO L225 Difference]: With dead ends: 42 [2022-04-15 07:08:02,726 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 07:08:02,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:08:02,727 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:02,727 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 07:08:02,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-04-15 07:08:02,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:02,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 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 07:08:02,731 INFO L74 IsIncluded]: Start isIncluded. First operand 33 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 07:08:02,731 INFO L87 Difference]: Start difference. First operand 33 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 07:08:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:02,732 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 07:08:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 07:08:02,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:02,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:02,732 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 33 states. [2022-04-15 07:08:02,732 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 33 states. [2022-04-15 07:08:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:02,733 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-15 07:08:02,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 07:08:02,733 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:02,733 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:02,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:02,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:02,733 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 07:08:02,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-15 07:08:02,734 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2022-04-15 07:08:02,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:02,734 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-15 07:08:02,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 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 07:08:02,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-15 07:08:02,770 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 07:08:02,770 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-15 07:08:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 07:08:02,770 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:02,770 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:02,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 07:08:02,771 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:02,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:02,771 INFO L85 PathProgramCache]: Analyzing trace with hash -289681005, now seen corresponding path program 4 times [2022-04-15 07:08:02,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:02,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1635784076] [2022-04-15 07:08:06,880 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:06,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:11,024 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:11,102 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:11,147 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:11,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:11,224 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:11,225 INFO L85 PathProgramCache]: Analyzing trace with hash 1694307855, now seen corresponding path program 1 times [2022-04-15 07:08:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:11,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126273584] [2022-04-15 07:08:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:11,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:11,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:11,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1264#true} is VALID [2022-04-15 07:08:11,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 07:08:11,268 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #56#return; {1264#true} is VALID [2022-04-15 07:08:11,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:11,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1264#true} is VALID [2022-04-15 07:08:11,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-15 07:08:11,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #56#return; {1264#true} is VALID [2022-04-15 07:08:11,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret7 := main(); {1264#true} is VALID [2022-04-15 07:08:11,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1269#(= main_~a~0 0)} is VALID [2022-04-15 07:08:11,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {1269#(= main_~a~0 0)} [70] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_54| |v_main_#t~pre5_53|)) (.cse1 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse2 (= v_main_~c~0_140 v_main_~c~0_135)) (.cse3 (= v_main_~b~0_75 v_main_~b~0_73)) (.cse4 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_98| |v_main_#t~pre6_102|) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_102| |v_main_#t~pre6_98|) .cse4))) InVars {main_~c~0=v_main_~c~0_140, main_~b~0=v_main_~b~0_75, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_54|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_102|} OutVars{main_~c~0=v_main_~c~0_135, main_~b~0=v_main_~b~0_73, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_53|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_98|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1269#(= main_~a~0 0)} is VALID [2022-04-15 07:08:11,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {1269#(= main_~a~0 0)} [69] L21-4_primed-->L21-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[] {1265#false} is VALID [2022-04-15 07:08:11,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1265#false} is VALID [2022-04-15 07:08:11,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-15 07:08:11,271 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 07:08:11,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:11,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126273584] [2022-04-15 07:08:11,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126273584] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:11,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:11,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:11,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:11,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1635784076] [2022-04-15 07:08:11,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1635784076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:11,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:11,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:08:11,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194960653] [2022-04-15 07:08:11,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:11,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:11,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:11,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:08:11,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:11,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:08:11,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:08:11,397 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,651 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 07:08:11,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:08:11,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:11,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 07:08:11,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-15 07:08:11,654 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-15 07:08:11,691 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:11,691 INFO L225 Difference]: With dead ends: 44 [2022-04-15 07:08:11,691 INFO L226 Difference]: Without dead ends: 35 [2022-04-15 07:08:11,692 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:08:11,692 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:11,692 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:11,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-15 07:08:11,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-15 07:08:11,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:11,696 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 07:08:11,696 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 07:08:11,696 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 07:08:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,697 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 07:08:11,697 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 07:08:11,698 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:11,698 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:11,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 35 states. [2022-04-15 07:08:11,698 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 35 states. [2022-04-15 07:08:11,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:11,699 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-15 07:08:11,699 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 07:08:11,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:11,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:11,699 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:11,699 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:11,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 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 07:08:11,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-15 07:08:11,700 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-15 07:08:11,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:11,700 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-15 07:08:11,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 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 07:08:11,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-15 07:08:11,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:11,727 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-15 07:08:11,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-15 07:08:11,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:11,727 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:11,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 07:08:11,727 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:11,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:11,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1490935601, now seen corresponding path program 5 times [2022-04-15 07:08:11,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:11,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1358097429] [2022-04-15 07:08:15,814 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:15,859 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:17,981 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:18,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:18,090 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:18,090 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1694369359, now seen corresponding path program 1 times [2022-04-15 07:08:18,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:18,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158718221] [2022-04-15 07:08:18,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:18,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:18,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:18,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:18,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:18,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1503#true} is VALID [2022-04-15 07:08:18,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 07:08:18,120 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1503#true} {1503#true} #56#return; {1503#true} is VALID [2022-04-15 07:08:18,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:18,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1503#true} is VALID [2022-04-15 07:08:18,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-15 07:08:18,121 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #56#return; {1503#true} is VALID [2022-04-15 07:08:18,121 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret7 := main(); {1503#true} is VALID [2022-04-15 07:08:18,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1508#(= main_~a~0 0)} is VALID [2022-04-15 07:08:18,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~a~0 0)} [72] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre6_133| |v_main_#t~pre6_128|) (= v_main_~c~0_179 v_main_~c~0_173) (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|) (= |v_main_#t~pre5_65| |v_main_#t~pre5_64|) (= v_main_~b~0_88 v_main_~b~0_86) (= v_main_~a~0_46 v_main_~a~0_45)) InVars {main_~c~0=v_main_~c~0_179, main_~b~0=v_main_~b~0_88, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_65|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_133|} OutVars{main_~c~0=v_main_~c~0_173, main_~b~0=v_main_~b~0_86, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_64|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_128|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1508#(= main_~a~0 0)} is VALID [2022-04-15 07:08:18,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {1508#(= main_~a~0 0)} [71] L21-4_primed-->L21-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[] {1504#false} is VALID [2022-04-15 07:08:18,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1504#false} is VALID [2022-04-15 07:08:18,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-15 07:08:18,150 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 07:08:18,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:18,150 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158718221] [2022-04-15 07:08:18,150 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158718221] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:18,150 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:18,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:18,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:18,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1358097429] [2022-04-15 07:08:18,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1358097429] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:18,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:18,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:08:18,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542705609] [2022-04-15 07:08:18,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:18,252 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 25 [2022-04-15 07:08:18,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:18,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 07:08:18,268 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 07:08:18,268 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:08:18,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:18,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:08:18,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:08:18,269 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 07:08:18,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:18,552 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 07:08:18,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:08:18,552 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 25 [2022-04-15 07:08:18,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:18,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 07:08:18,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-15 07:08:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 07:08:18,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-15 07:08:18,554 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-15 07:08:18,592 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 07:08:18,592 INFO L225 Difference]: With dead ends: 46 [2022-04-15 07:08:18,593 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 07:08:18,593 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:08:18,593 INFO L913 BasicCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:18,593 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 33 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:18,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 07:08:18,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-04-15 07:08:18,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:18,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 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 07:08:18,598 INFO L74 IsIncluded]: Start isIncluded. First operand 37 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 07:08:18,598 INFO L87 Difference]: Start difference. First operand 37 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 07:08:18,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:18,599 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 07:08:18,599 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 07:08:18,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:18,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:18,599 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 37 states. [2022-04-15 07:08:18,599 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 37 states. [2022-04-15 07:08:18,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:18,600 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-15 07:08:18,600 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 07:08:18,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:18,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:18,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:18,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:18,600 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 07:08:18,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-15 07:08:18,601 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2022-04-15 07:08:18,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:18,601 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-15 07:08:18,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 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 07:08:18,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-15 07:08:18,639 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 07:08:18,639 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-15 07:08:18,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 07:08:18,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:18,640 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:18,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 07:08:18,640 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:18,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1028457137, now seen corresponding path program 6 times [2022-04-15 07:08:18,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:18,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1608834186] [2022-04-15 07:08:18,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:18,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:19,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:19,001 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:19,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:19,089 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:19,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1694430863, now seen corresponding path program 1 times [2022-04-15 07:08:19,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:19,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018507727] [2022-04-15 07:08:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:19,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:19,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:19,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:19,117 INFO L290 TraceCheckUtils]: 0: Hoare triple {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1757#true} is VALID [2022-04-15 07:08:19,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-04-15 07:08:19,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1757#true} {1757#true} #56#return; {1757#true} is VALID [2022-04-15 07:08:19,118 INFO L272 TraceCheckUtils]: 0: Hoare triple {1757#true} call ULTIMATE.init(); {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:19,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1757#true} is VALID [2022-04-15 07:08:19,118 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-04-15 07:08:19,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1757#true} {1757#true} #56#return; {1757#true} is VALID [2022-04-15 07:08:19,118 INFO L272 TraceCheckUtils]: 4: Hoare triple {1757#true} call #t~ret7 := main(); {1757#true} is VALID [2022-04-15 07:08:19,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {1757#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1762#(= main_~a~0 0)} is VALID [2022-04-15 07:08:19,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {1762#(= main_~a~0 0)} [74] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse1 (= v_main_~b~0_98 v_main_~b~0_96)) (.cse2 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse3 (= |v_main_#t~pre5_72| |v_main_#t~pre5_71|)) (.cse4 (= v_main_~c~0_217 v_main_~c~0_210))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_162| |v_main_#t~pre6_156|)) (and (= |v_main_#t~pre6_156| |v_main_#t~pre6_162|) .cse0 .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_217, main_~b~0=v_main_~b~0_98, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_72|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_162|} OutVars{main_~c~0=v_main_~c~0_210, main_~b~0=v_main_~b~0_96, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_71|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_156|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1762#(= main_~a~0 0)} is VALID [2022-04-15 07:08:19,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {1762#(= main_~a~0 0)} [73] L21-4_primed-->L21-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[] {1758#false} is VALID [2022-04-15 07:08:19,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {1758#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1758#false} is VALID [2022-04-15 07:08:19,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {1758#false} assume !false; {1758#false} is VALID [2022-04-15 07:08:19,120 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 07:08:19,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:19,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018507727] [2022-04-15 07:08:19,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018507727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:19,120 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:19,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:19,240 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:19,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1608834186] [2022-04-15 07:08:19,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1608834186] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:19,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:19,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:08:19,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076213834] [2022-04-15 07:08:19,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:19,242 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:19,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,261 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 07:08:19,261 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:08:19,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:19,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:08:19,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:08:19,262 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:19,666 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-15 07:08:19,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:08:19,666 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-15 07:08:19,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-15 07:08:19,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-15 07:08:19,705 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 07:08:19,706 INFO L225 Difference]: With dead ends: 46 [2022-04-15 07:08:19,706 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 07:08:19,706 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:08:19,706 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:19,707 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 37 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:08:19,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 07:08:19,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-15 07:08:19,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:19,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 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 07:08:19,712 INFO L74 IsIncluded]: Start isIncluded. First operand 37 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 07:08:19,712 INFO L87 Difference]: Start difference. First operand 37 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 07:08:19,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:19,712 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 07:08:19,712 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 07:08:19,713 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:19,713 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:19,713 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 37 states. [2022-04-15 07:08:19,713 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 37 states. [2022-04-15 07:08:19,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:19,714 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-15 07:08:19,714 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-15 07:08:19,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:19,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:19,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:19,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:19,714 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 07:08:19,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-15 07:08:19,715 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-15 07:08:19,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:19,715 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-15 07:08:19,715 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 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 07:08:19,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-15 07:08:19,751 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 07:08:19,751 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-15 07:08:19,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 07:08:19,751 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:19,751 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:19,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 07:08:19,752 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:19,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash -676441370, now seen corresponding path program 7 times [2022-04-15 07:08:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:19,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [833008622] [2022-04-15 07:08:23,915 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:23,969 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:24,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,171 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:28,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,319 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:28,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:28,384 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,451 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:28,451 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:28,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1694492367, now seen corresponding path program 1 times [2022-04-15 07:08:28,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:28,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016903155] [2022-04-15 07:08:28,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:28,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:28,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:28,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:28,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:28,484 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); {2025#true} is VALID [2022-04-15 07:08:28,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2025#true} assume true; {2025#true} is VALID [2022-04-15 07:08:28,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2025#true} {2025#true} #56#return; {2025#true} is VALID [2022-04-15 07:08:28,484 INFO L272 TraceCheckUtils]: 0: Hoare triple {2025#true} call ULTIMATE.init(); {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:28,485 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); {2025#true} is VALID [2022-04-15 07:08:28,485 INFO L290 TraceCheckUtils]: 2: Hoare triple {2025#true} assume true; {2025#true} is VALID [2022-04-15 07:08:28,485 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2025#true} {2025#true} #56#return; {2025#true} is VALID [2022-04-15 07:08:28,485 INFO L272 TraceCheckUtils]: 4: Hoare triple {2025#true} call #t~ret7 := main(); {2025#true} is VALID [2022-04-15 07:08:28,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {2025#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2030#(= main_~a~0 0)} is VALID [2022-04-15 07:08:28,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {2030#(= main_~a~0 0)} [76] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_129 v_main_~b~0_126)) (.cse1 (= |v_main_#t~pre6_191| |v_main_#t~pre6_185|)) (.cse2 (= |v_main_#t~pre5_97| |v_main_#t~pre5_95|)) (.cse3 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|))) (or (and .cse0 .cse1 .cse2 (= v_main_~a~0_57 v_main_~a~0_58) .cse3 (= v_main_~c~0_267 v_main_~c~0_275)) (and .cse0 (= v_main_~c~0_275 v_main_~c~0_267) .cse1 .cse2 .cse3 (= v_main_~a~0_58 v_main_~a~0_57)))) InVars {main_~c~0=v_main_~c~0_275, main_~b~0=v_main_~b~0_129, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_97|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_191|} OutVars{main_~c~0=v_main_~c~0_267, main_~b~0=v_main_~b~0_126, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_95|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_185|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2030#(= main_~a~0 0)} is VALID [2022-04-15 07:08:28,486 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#(= main_~a~0 0)} [75] L21-4_primed-->L21-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[] {2026#false} is VALID [2022-04-15 07:08:28,486 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2026#false} is VALID [2022-04-15 07:08:28,486 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#false} assume !false; {2026#false} is VALID [2022-04-15 07:08:28,486 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 07:08:28,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:28,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016903155] [2022-04-15 07:08:28,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016903155] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:28,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:28,487 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:28,655 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:28,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [833008622] [2022-04-15 07:08:28,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [833008622] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:28,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:28,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:08:28,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683616158] [2022-04-15 07:08:28,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:28,656 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 30 [2022-04-15 07:08:28,656 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:28,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 07:08:28,674 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 07:08:28,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:08:28,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:28,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:08:28,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:08:28,675 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 07:08:29,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:29,150 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-15 07:08:29,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:08:29,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 30 [2022-04-15 07:08:29,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 07:08:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-15 07:08:29,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 07:08:29,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-15 07:08:29,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-15 07:08:29,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:29,187 INFO L225 Difference]: With dead ends: 48 [2022-04-15 07:08:29,187 INFO L226 Difference]: Without dead ends: 39 [2022-04-15 07:08:29,187 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:08:29,188 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:29,188 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:08:29,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-15 07:08:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-15 07:08:29,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:29,192 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 07:08:29,193 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 07:08:29,193 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 07:08:29,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:29,193 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 07:08:29,193 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 07:08:29,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:29,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:29,194 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 39 states. [2022-04-15 07:08:29,194 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 39 states. [2022-04-15 07:08:29,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:29,194 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-15 07:08:29,194 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-15 07:08:29,195 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:29,195 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:29,195 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:29,195 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:29,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 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 07:08:29,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-15 07:08:29,195 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2022-04-15 07:08:29,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:29,196 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-15 07:08:29,196 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 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 07:08:29,196 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-15 07:08:29,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:29,234 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-15 07:08:29,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:08:29,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:29,234 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:29,234 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 07:08:29,234 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:29,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:29,234 INFO L85 PathProgramCache]: Analyzing trace with hash -818587708, now seen corresponding path program 8 times [2022-04-15 07:08:29,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:29,235 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [855671127] [2022-04-15 07:08:33,420 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:33,466 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:33,558 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:37,640 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:37,683 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:37,788 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:37,837 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:37,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:37,844 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:37,906 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:37,907 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:37,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1694553871, now seen corresponding path program 1 times [2022-04-15 07:08:37,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:37,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771389023] [2022-04-15 07:08:37,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:37,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:37,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:37,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:37,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2306#true} is VALID [2022-04-15 07:08:37,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {2306#true} assume true; {2306#true} is VALID [2022-04-15 07:08:37,933 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2306#true} {2306#true} #56#return; {2306#true} is VALID [2022-04-15 07:08:37,934 INFO L272 TraceCheckUtils]: 0: Hoare triple {2306#true} call ULTIMATE.init(); {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:37,934 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2306#true} is VALID [2022-04-15 07:08:37,934 INFO L290 TraceCheckUtils]: 2: Hoare triple {2306#true} assume true; {2306#true} is VALID [2022-04-15 07:08:37,934 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2306#true} {2306#true} #56#return; {2306#true} is VALID [2022-04-15 07:08:37,934 INFO L272 TraceCheckUtils]: 4: Hoare triple {2306#true} call #t~ret7 := main(); {2306#true} is VALID [2022-04-15 07:08:37,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {2306#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2311#(= main_~a~0 0)} is VALID [2022-04-15 07:08:37,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {2311#(= main_~a~0 0)} [78] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_123| |v_main_#t~pre5_121|) (= v_main_~b~0_162 v_main_~b~0_159) (= |v_main_#t~pre6_228| |v_main_#t~pre6_221|) (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|) (= v_main_~a~0_64 v_main_~a~0_63) (= v_main_~c~0_339 v_main_~c~0_330)) InVars {main_~c~0=v_main_~c~0_339, main_~b~0=v_main_~b~0_162, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_228|} OutVars{main_~c~0=v_main_~c~0_330, main_~b~0=v_main_~b~0_159, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_121|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_221|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2311#(= main_~a~0 0)} is VALID [2022-04-15 07:08:37,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#(= main_~a~0 0)} [77] L21-4_primed-->L21-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[] {2307#false} is VALID [2022-04-15 07:08:37,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {2307#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2307#false} is VALID [2022-04-15 07:08:37,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {2307#false} assume !false; {2307#false} is VALID [2022-04-15 07:08:37,936 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 07:08:37,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:37,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771389023] [2022-04-15 07:08:37,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771389023] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:37,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:37,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:38,102 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:38,103 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [855671127] [2022-04-15 07:08:38,103 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [855671127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:38,103 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:38,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 07:08:38,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128712489] [2022-04-15 07:08:38,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:38,103 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 32 [2022-04-15 07:08:38,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:38,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 07:08:38,124 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:38,125 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 07:08:38,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:38,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 07:08:38,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:08:38,125 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 07:08:38,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:38,603 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-15 07:08:38,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 07:08:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 32 [2022-04-15 07:08:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:38,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 07:08:38,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-15 07:08:38,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 07:08:38,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-15 07:08:38,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2022-04-15 07:08:38,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:38,646 INFO L225 Difference]: With dead ends: 50 [2022-04-15 07:08:38,646 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 07:08:38,646 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:08:38,647 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:38,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 17 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:08:38,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 07:08:38,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-15 07:08:38,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:38,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 07:08:38,652 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 07:08:38,652 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 07:08:38,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:38,653 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 07:08:38,653 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 07:08:38,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:38,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:38,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 41 states. [2022-04-15 07:08:38,653 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 41 states. [2022-04-15 07:08:38,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:38,654 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-15 07:08:38,654 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-15 07:08:38,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:38,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:38,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:38,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:38,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 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 07:08:38,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-15 07:08:38,655 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2022-04-15 07:08:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:38,655 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-15 07:08:38,655 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 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 07:08:38,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-15 07:08:38,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:38,692 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-15 07:08:38,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:08:38,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:38,693 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:38,693 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 07:08:38,693 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:38,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 17734946, now seen corresponding path program 9 times [2022-04-15 07:08:38,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:38,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1226528192] [2022-04-15 07:08:41,602 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:41,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:41,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:44,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:44,485 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:44,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:44,553 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:44,553 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:44,663 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:44,663 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:44,666 INFO L85 PathProgramCache]: Analyzing trace with hash 1694615375, now seen corresponding path program 1 times [2022-04-15 07:08:44,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:44,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378119475] [2022-04-15 07:08:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:44,666 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:44,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:44,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:44,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:44,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2602#true} is VALID [2022-04-15 07:08:44,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {2602#true} assume true; {2602#true} is VALID [2022-04-15 07:08:44,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2602#true} {2602#true} #56#return; {2602#true} is VALID [2022-04-15 07:08:44,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {2602#true} call ULTIMATE.init(); {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:44,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2602#true} is VALID [2022-04-15 07:08:44,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {2602#true} assume true; {2602#true} is VALID [2022-04-15 07:08:44,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2602#true} {2602#true} #56#return; {2602#true} is VALID [2022-04-15 07:08:44,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {2602#true} call #t~ret7 := main(); {2602#true} is VALID [2022-04-15 07:08:44,697 INFO L290 TraceCheckUtils]: 5: Hoare triple {2602#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2607#(= main_~a~0 0)} is VALID [2022-04-15 07:08:44,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {2607#(= main_~a~0 0)} [80] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse1 (= |v_main_#t~pre5_149| |v_main_#t~pre5_147|)) (.cse2 (= v_main_~c~0_406 v_main_~c~0_396))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) .cse0 (= |v_main_#t~pre6_259| |v_main_#t~pre6_267|) .cse1 .cse2 (= v_main_~b~0_192 v_main_~b~0_195)) (and (= v_main_~b~0_195 v_main_~b~0_192) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_267| |v_main_#t~pre6_259|) (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_~c~0=v_main_~c~0_406, main_~b~0=v_main_~b~0_195, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_149|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_267|} OutVars{main_~c~0=v_main_~c~0_396, main_~b~0=v_main_~b~0_192, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_259|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2607#(= main_~a~0 0)} is VALID [2022-04-15 07:08:44,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#(= main_~a~0 0)} [79] L21-4_primed-->L21-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[] {2603#false} is VALID [2022-04-15 07:08:44,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2603#false} is VALID [2022-04-15 07:08:44,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {2603#false} assume !false; {2603#false} is VALID [2022-04-15 07:08:44,698 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 07:08:44,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:44,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378119475] [2022-04-15 07:08:44,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378119475] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:44,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:44,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:44,884 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:44,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1226528192] [2022-04-15 07:08:44,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1226528192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:44,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:44,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:08:44,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389266420] [2022-04-15 07:08:44,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:44,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 34 [2022-04-15 07:08:44,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:44,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 07:08:44,912 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 07:08:44,912 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:08:44,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:44,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:08:44,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:08:44,913 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 07:08:45,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:45,420 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-15 07:08:45,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:08:45,421 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 34 [2022-04-15 07:08:45,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:45,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 07:08:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-15 07:08:45,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 07:08:45,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-15 07:08:45,422 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 59 transitions. [2022-04-15 07:08:45,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:45,466 INFO L225 Difference]: With dead ends: 52 [2022-04-15 07:08:45,466 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 07:08:45,466 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:08:45,467 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:45,467 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:08:45,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 07:08:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-04-15 07:08:45,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:45,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 07:08:45,473 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 07:08:45,473 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 07:08:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:45,474 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 07:08:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:08:45,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:45,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:45,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 43 states. [2022-04-15 07:08:45,474 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 43 states. [2022-04-15 07:08:45,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:45,475 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-15 07:08:45,475 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-15 07:08:45,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:45,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:45,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:45,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:45,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 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 07:08:45,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-15 07:08:45,476 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-04-15 07:08:45,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:45,476 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-15 07:08:45,476 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 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 07:08:45,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-15 07:08:45,517 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 07:08:45,517 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-15 07:08:45,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:08:45,518 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:45,518 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:45,518 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 07:08:45,518 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash 564921088, now seen corresponding path program 10 times [2022-04-15 07:08:45,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:45,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [396051005] [2022-04-15 07:08:49,720 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:49,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:49,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:52,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:52,782 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:52,826 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:52,833 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:52,833 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:52,915 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:52,915 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1694676879, now seen corresponding path program 1 times [2022-04-15 07:08:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:52,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001701070] [2022-04-15 07:08:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:52,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:52,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2913#true} is VALID [2022-04-15 07:08:52,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {2913#true} assume true; {2913#true} is VALID [2022-04-15 07:08:52,945 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2913#true} {2913#true} #56#return; {2913#true} is VALID [2022-04-15 07:08:52,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {2913#true} call ULTIMATE.init(); {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:52,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2913#true} is VALID [2022-04-15 07:08:52,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {2913#true} assume true; {2913#true} is VALID [2022-04-15 07:08:52,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2913#true} {2913#true} #56#return; {2913#true} is VALID [2022-04-15 07:08:52,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {2913#true} call #t~ret7 := main(); {2913#true} is VALID [2022-04-15 07:08:52,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {2913#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2918#(= main_~a~0 0)} is VALID [2022-04-15 07:08:52,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {2918#(= main_~a~0 0)} [82] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse1 (= v_main_~b~0_228 v_main_~b~0_225)) (.cse2 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|)) (.cse3 (= |v_main_#t~pre5_175| |v_main_#t~pre5_173|)) (.cse4 (= |v_main_#t~pre6_308| |v_main_#t~pre6_299|))) (or (and (= v_main_~c~0_465 v_main_~c~0_476) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= v_main_~c~0_476 v_main_~c~0_465) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_476, main_~b~0=v_main_~b~0_228, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_175|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_308|} OutVars{main_~c~0=v_main_~c~0_465, main_~b~0=v_main_~b~0_225, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_173|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_299|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2918#(= main_~a~0 0)} is VALID [2022-04-15 07:08:52,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2918#(= main_~a~0 0)} [81] L21-4_primed-->L21-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[] {2914#false} is VALID [2022-04-15 07:08:52,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2914#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2914#false} is VALID [2022-04-15 07:08:52,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {2914#false} assume !false; {2914#false} is VALID [2022-04-15 07:08:52,948 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 07:08:52,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:52,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001701070] [2022-04-15 07:08:52,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001701070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:52,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:52,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:53,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:53,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [396051005] [2022-04-15 07:08:53,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [396051005] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:53,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:53,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:08:53,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527137828] [2022-04-15 07:08:53,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:53,171 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 36 [2022-04-15 07:08:53,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:53,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 07:08:53,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:53,194 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:08:53,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:53,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:08:53,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:08:53,194 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 07:08:53,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:53,735 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-04-15 07:08:53,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:08:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 36 [2022-04-15 07:08:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 07:08:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2022-04-15 07:08:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 07:08:53,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2022-04-15 07:08:53,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 61 transitions. [2022-04-15 07:08:53,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:53,786 INFO L225 Difference]: With dead ends: 54 [2022-04-15 07:08:53,786 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 07:08:53,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:08:53,787 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:53,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 22 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:08:53,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 07:08:53,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-04-15 07:08:53,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:53,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 07:08:53,794 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 07:08:53,794 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 07:08:53,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:53,795 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 07:08:53,795 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 07:08:53,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:53,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:53,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 45 states. [2022-04-15 07:08:53,795 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 45 states. [2022-04-15 07:08:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:53,796 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-15 07:08:53,796 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-15 07:08:53,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:53,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:53,796 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:53,796 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:53,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 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 07:08:53,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-15 07:08:53,797 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2022-04-15 07:08:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:53,797 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-15 07:08:53,797 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 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 07:08:53,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-15 07:08:53,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:53,845 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-15 07:08:53,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 07:08:53,845 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:53,845 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:53,846 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 07:08:53,846 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:53,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:53,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1870173858, now seen corresponding path program 11 times [2022-04-15 07:08:53,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:53,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1497749053] [2022-04-15 07:08:54,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,161 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,285 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,376 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,422 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,429 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:08:54,429 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:08:54,514 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,514 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:54,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1694738383, now seen corresponding path program 1 times [2022-04-15 07:08:54,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:54,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456838233] [2022-04-15 07:08:54,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:54,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:54,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3239#true} is VALID [2022-04-15 07:08:54,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-15 07:08:54,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3239#true} {3239#true} #56#return; {3239#true} is VALID [2022-04-15 07:08:54,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:54,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3239#true} is VALID [2022-04-15 07:08:54,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-15 07:08:54,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #56#return; {3239#true} is VALID [2022-04-15 07:08:54,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret7 := main(); {3239#true} is VALID [2022-04-15 07:08:54,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {3239#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3244#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {3244#(= main_~a~0 0)} [84] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_549 v_main_~c~0_537) (= v_main_~a~0_82 v_main_~a~0_81) (= |v_main_#t~pre5_201| |v_main_#t~pre5_199|) (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|) (= |v_main_#t~pre6_351| |v_main_#t~pre6_341|) (= v_main_~b~0_261 v_main_~b~0_258)) InVars {main_~c~0=v_main_~c~0_549, main_~b~0=v_main_~b~0_261, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_351|} OutVars{main_~c~0=v_main_~c~0_537, main_~b~0=v_main_~b~0_258, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_199|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_341|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3244#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {3244#(= main_~a~0 0)} [83] L21-4_primed-->L21-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[] {3240#false} is VALID [2022-04-15 07:08:54,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {3240#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3240#false} is VALID [2022-04-15 07:08:54,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-15 07:08:54,544 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 07:08:54,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:54,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456838233] [2022-04-15 07:08:54,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456838233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:54,769 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:54,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1497749053] [2022-04-15 07:08:54,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1497749053] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,771 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:08:54,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1451053190] [2022-04-15 07:08:54,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:54,771 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 38 [2022-04-15 07:08:54,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:54,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 07:08:54,794 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 07:08:54,794 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:08:54,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:54,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:08:54,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:08:54,795 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 07:08:55,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,524 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-04-15 07:08:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:08:55,525 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 38 [2022-04-15 07:08:55,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:55,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 07:08:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-15 07:08:55,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 07:08:55,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-15 07:08:55,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 63 transitions. [2022-04-15 07:08:55,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:55,568 INFO L225 Difference]: With dead ends: 56 [2022-04-15 07:08:55,568 INFO L226 Difference]: Without dead ends: 47 [2022-04-15 07:08:55,569 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:08:55,569 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:55,569 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 67 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:08:55,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-15 07:08:55,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-15 07:08:55,579 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:55,579 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 07:08:55,579 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 07:08:55,579 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 07:08:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,580 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 07:08:55,580 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 07:08:55,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,580 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 47 states. [2022-04-15 07:08:55,581 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 47 states. [2022-04-15 07:08:55,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,581 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-15 07:08:55,581 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-15 07:08:55,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:55,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:55,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 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 07:08:55,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-15 07:08:55,582 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2022-04-15 07:08:55,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:55,582 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-15 07:08:55,582 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 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 07:08:55,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-15 07:08:55,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:55,634 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-15 07:08:55,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-15 07:08:55,635 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:55,635 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:55,635 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 07:08:55,635 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:55,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:55,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1239240644, now seen corresponding path program 12 times [2022-04-15 07:08:55,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:55,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1825684786] [2022-04-15 07:08:58,328 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:58,377 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:58,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:02,559 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:02,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:02,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:02,741 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:02,747 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:09:02,747 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:02,847 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:02,847 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:02,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1694799887, now seen corresponding path program 1 times [2022-04-15 07:09:02,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:02,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606075326] [2022-04-15 07:09:02,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:02,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:02,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:02,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:02,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:02,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3580#true} is VALID [2022-04-15 07:09:02,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 07:09:02,872 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3580#true} {3580#true} #56#return; {3580#true} is VALID [2022-04-15 07:09:02,872 INFO L272 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:02,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3580#true} is VALID [2022-04-15 07:09:02,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-15 07:09:02,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #56#return; {3580#true} is VALID [2022-04-15 07:09:02,873 INFO L272 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret7 := main(); {3580#true} is VALID [2022-04-15 07:09:02,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3585#(= main_~a~0 0)} is VALID [2022-04-15 07:09:02,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {3585#(= main_~a~0 0)} [86] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_88 v_main_~a~0_87)) (.cse1 (= |v_main_#t~pre6_396| |v_main_#t~pre6_385|)) (.cse2 (= v_main_~c~0_625 v_main_~c~0_612)) (.cse3 (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|)) (.cse4 (= |v_main_#t~pre5_227| |v_main_#t~pre5_225|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_291 v_main_~b~0_294)) (and .cse0 .cse1 (= v_main_~b~0_294 v_main_~b~0_291) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_625, main_~b~0=v_main_~b~0_294, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_227|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_396|} OutVars{main_~c~0=v_main_~c~0_612, main_~b~0=v_main_~b~0_291, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_385|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3585#(= main_~a~0 0)} is VALID [2022-04-15 07:09:02,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {3585#(= main_~a~0 0)} [85] L21-4_primed-->L21-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[] {3581#false} is VALID [2022-04-15 07:09:02,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3581#false} is VALID [2022-04-15 07:09:02,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#false} assume !false; {3581#false} is VALID [2022-04-15 07:09:02,884 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 07:09:02,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:02,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606075326] [2022-04-15 07:09:02,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606075326] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:02,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:02,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:03,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:03,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1825684786] [2022-04-15 07:09:03,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1825684786] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:03,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:03,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:09:03,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510558604] [2022-04-15 07:09:03,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:03,124 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 40 [2022-04-15 07:09:03,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:03,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 07:09:03,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:03,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:09:03,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:03,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:09:03,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:09:03,148 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 07:09:03,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:03,959 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-15 07:09:03,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:09:03,959 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 40 [2022-04-15 07:09:03,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 07:09:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2022-04-15 07:09:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 07:09:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2022-04-15 07:09:03,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2022-04-15 07:09:04,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:04,017 INFO L225 Difference]: With dead ends: 60 [2022-04-15 07:09:04,017 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:09:04,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:09:04,018 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:04,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 27 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:09:04,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:09:04,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-15 07:09:04,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:04,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 07:09:04,025 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 07:09:04,025 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 07:09:04,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:04,026 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 07:09:04,026 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 07:09:04,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:04,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:04,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 51 states. [2022-04-15 07:09:04,026 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 51 states. [2022-04-15 07:09:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:04,027 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-15 07:09:04,027 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-15 07:09:04,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:04,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:04,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:04,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:04,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 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 07:09:04,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-15 07:09:04,028 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2022-04-15 07:09:04,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:04,028 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-15 07:09:04,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 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 07:09:04,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-15 07:09:04,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:04,078 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-15 07:09:04,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 07:09:04,078 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:04,078 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:04,078 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 07:09:04,078 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:04,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:04,079 INFO L85 PathProgramCache]: Analyzing trace with hash -502810726, now seen corresponding path program 13 times [2022-04-15 07:09:04,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:04,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1416517756] [2022-04-15 07:09:08,243 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:08,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:08,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:11,875 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:11,921 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,236 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,236 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:12,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1694861391, now seen corresponding path program 1 times [2022-04-15 07:09:12,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:12,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147676110] [2022-04-15 07:09:12,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:12,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:12,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:12,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3948#true} is VALID [2022-04-15 07:09:12,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-04-15 07:09:12,263 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3948#true} {3948#true} #56#return; {3948#true} is VALID [2022-04-15 07:09:12,263 INFO L272 TraceCheckUtils]: 0: Hoare triple {3948#true} call ULTIMATE.init(); {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:12,263 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3948#true} is VALID [2022-04-15 07:09:12,263 INFO L290 TraceCheckUtils]: 2: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-04-15 07:09:12,263 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3948#true} {3948#true} #56#return; {3948#true} is VALID [2022-04-15 07:09:12,263 INFO L272 TraceCheckUtils]: 4: Hoare triple {3948#true} call #t~ret7 := main(); {3948#true} is VALID [2022-04-15 07:09:12,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {3948#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3953#(= main_~a~0 0)} is VALID [2022-04-15 07:09:12,264 INFO L290 TraceCheckUtils]: 6: Hoare triple {3953#(= main_~a~0 0)} [88] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre5_251| |v_main_#t~pre5_249|)) (.cse2 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse3 (= |v_main_#t~pre6_436| |v_main_#t~pre6_424|)) (.cse4 (= v_main_~b~0_323 v_main_~b~0_320))) (or (and (= v_main_~c~0_696 v_main_~c~0_682) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= v_main_~c~0_682 v_main_~c~0_696) .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_696, main_~b~0=v_main_~b~0_323, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_251|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_436|} OutVars{main_~c~0=v_main_~c~0_682, main_~b~0=v_main_~b~0_320, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_424|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3953#(= main_~a~0 0)} is VALID [2022-04-15 07:09:12,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {3953#(= main_~a~0 0)} [87] L21-4_primed-->L21-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[] {3949#false} is VALID [2022-04-15 07:09:12,265 INFO L290 TraceCheckUtils]: 8: Hoare triple {3949#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3949#false} is VALID [2022-04-15 07:09:12,265 INFO L290 TraceCheckUtils]: 9: Hoare triple {3949#false} assume !false; {3949#false} is VALID [2022-04-15 07:09:12,265 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 07:09:12,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:12,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147676110] [2022-04-15 07:09:12,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147676110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:12,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:12,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:12,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:12,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1416517756] [2022-04-15 07:09:12,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1416517756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:12,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:12,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:09:12,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443867652] [2022-04-15 07:09:12,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:12,548 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 42 [2022-04-15 07:09:12,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:12,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 07:09:12,574 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 07:09:12,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 07:09:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 07:09:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:09:12,575 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 07:09:13,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,353 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-15 07:09:13,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 07:09:13,353 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 42 [2022-04-15 07:09:13,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:13,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 07:09:13,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-15 07:09:13,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 07:09:13,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-15 07:09:13,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2022-04-15 07:09:13,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:13,407 INFO L225 Difference]: With dead ends: 61 [2022-04-15 07:09:13,407 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 07:09:13,408 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:09:13,408 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:13,408 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 47 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:09:13,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 07:09:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-04-15 07:09:13,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:13,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 07:09:13,420 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 07:09:13,420 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 07:09:13,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,421 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 07:09:13,421 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 07:09:13,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:13,421 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:13,421 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 52 states. [2022-04-15 07:09:13,422 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 52 states. [2022-04-15 07:09:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,422 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-15 07:09:13,422 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 07:09:13,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:13,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:13,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:13,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:13,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 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 07:09:13,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-15 07:09:13,423 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-15 07:09:13,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:13,423 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-15 07:09:13,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 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 07:09:13,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-15 07:09:13,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-15 07:09:13,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 07:09:13,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:13,498 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:13,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 07:09:13,499 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:13,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:13,499 INFO L85 PathProgramCache]: Analyzing trace with hash -594972485, now seen corresponding path program 14 times [2022-04-15 07:09:13,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:13,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808972280] [2022-04-15 07:09:17,455 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:17,496 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:17,587 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:21,665 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:21,709 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:21,801 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:25,915 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:25,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:26,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:26,104 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:26,104 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:26,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1694922895, now seen corresponding path program 1 times [2022-04-15 07:09:26,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:26,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130022290] [2022-04-15 07:09:26,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:26,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:26,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:26,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:26,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4327#true} is VALID [2022-04-15 07:09:26,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2022-04-15 07:09:26,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #56#return; {4327#true} is VALID [2022-04-15 07:09:26,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:26,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4327#true} is VALID [2022-04-15 07:09:26,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2022-04-15 07:09:26,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4327#true} #56#return; {4327#true} is VALID [2022-04-15 07:09:26,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2022-04-15 07:09:26,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {4327#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4332#(= main_~a~0 0)} is VALID [2022-04-15 07:09:26,133 INFO L290 TraceCheckUtils]: 6: Hoare triple {4332#(= main_~a~0 0)} [90] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_476| |v_main_#t~pre6_464|)) (.cse1 (= v_main_~b~0_361 v_main_~b~0_357)) (.cse2 (= v_main_~a~0_100 v_main_~a~0_99))) (or (and .cse0 .cse1 (= v_main_~c~0_775 v_main_~c~0_760) .cse2 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) (= |v_main_#t~pre5_282| |v_main_#t~pre5_279|)) (and (= v_main_~c~0_760 v_main_~c~0_775) .cse0 .cse1 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) (= |v_main_#t~pre5_279| |v_main_#t~pre5_282|) .cse2))) InVars {main_~c~0=v_main_~c~0_775, main_~b~0=v_main_~b~0_361, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_282|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_476|} OutVars{main_~c~0=v_main_~c~0_760, main_~b~0=v_main_~b~0_357, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_279|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_464|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4332#(= main_~a~0 0)} is VALID [2022-04-15 07:09:26,133 INFO L290 TraceCheckUtils]: 7: Hoare triple {4332#(= main_~a~0 0)} [89] L21-4_primed-->L21-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[] {4328#false} is VALID [2022-04-15 07:09:26,133 INFO L290 TraceCheckUtils]: 8: Hoare triple {4328#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4328#false} is VALID [2022-04-15 07:09:26,133 INFO L290 TraceCheckUtils]: 9: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2022-04-15 07:09:26,133 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 07:09:26,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:26,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130022290] [2022-04-15 07:09:26,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130022290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:26,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:26,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:26,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:26,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808972280] [2022-04-15 07:09:26,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808972280] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:26,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:26,425 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:09:26,425 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821454062] [2022-04-15 07:09:26,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:26,426 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-15 07:09:26,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:26,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:09:26,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:26,452 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 07:09:26,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:26,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 07:09:26,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:09:26,453 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:09:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:27,257 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-15 07:09:27,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 07:09:27,258 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 45 [2022-04-15 07:09:27,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:27,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:09:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-15 07:09:27,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:09:27,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-15 07:09:27,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2022-04-15 07:09:27,324 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 07:09:27,324 INFO L225 Difference]: With dead ends: 63 [2022-04-15 07:09:27,325 INFO L226 Difference]: Without dead ends: 54 [2022-04-15 07:09:27,325 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:09:27,325 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:27,326 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:09:27,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-15 07:09:27,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-04-15 07:09:27,334 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:27,334 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 07:09:27,334 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 07:09:27,334 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 07:09:27,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:27,335 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 07:09:27,335 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 07:09:27,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:27,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:27,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 54 states. [2022-04-15 07:09:27,335 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 54 states. [2022-04-15 07:09:27,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:27,336 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-15 07:09:27,336 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 07:09:27,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:27,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:27,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:27,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 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 07:09:27,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-15 07:09:27,337 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-04-15 07:09:27,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:27,337 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-15 07:09:27,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 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 07:09:27,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2022-04-15 07:09:27,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:27,396 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-15 07:09:27,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 07:09:27,396 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:27,396 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:27,396 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 07:09:27,396 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:27,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:27,396 INFO L85 PathProgramCache]: Analyzing trace with hash 163599449, now seen corresponding path program 15 times [2022-04-15 07:09:27,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:27,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [738387022] [2022-04-15 07:09:27,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:27,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:27,806 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:27,887 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:27,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:27,936 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:09:27,936 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:28,023 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:28,023 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:28,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1694984399, now seen corresponding path program 1 times [2022-04-15 07:09:28,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:28,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125432748] [2022-04-15 07:09:28,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:28,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:28,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:28,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:28,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:28,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4719#true} is VALID [2022-04-15 07:09:28,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-15 07:09:28,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4719#true} {4719#true} #56#return; {4719#true} is VALID [2022-04-15 07:09:28,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:28,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4719#true} is VALID [2022-04-15 07:09:28,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-15 07:09:28,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #56#return; {4719#true} is VALID [2022-04-15 07:09:28,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret7 := main(); {4719#true} is VALID [2022-04-15 07:09:28,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4724#(= main_~a~0 0)} is VALID [2022-04-15 07:09:28,046 INFO L290 TraceCheckUtils]: 6: Hoare triple {4724#(= main_~a~0 0)} [92] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_853 v_main_~c~0_837) (= v_main_~a~0_106 v_main_~a~0_105) (= |v_main_#t~pre6_519| |v_main_#t~pre6_506|) (= v_main_~b~0_396 v_main_~b~0_392) (= |v_main_#t~pre5_309| |v_main_#t~pre5_306|) (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|)) InVars {main_~c~0=v_main_~c~0_853, main_~b~0=v_main_~b~0_396, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_309|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_519|} OutVars{main_~c~0=v_main_~c~0_837, main_~b~0=v_main_~b~0_392, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_306|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_506|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4724#(= main_~a~0 0)} is VALID [2022-04-15 07:09:28,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {4724#(= main_~a~0 0)} [91] L21-4_primed-->L21-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[] {4720#false} is VALID [2022-04-15 07:09:28,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {4720#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4720#false} is VALID [2022-04-15 07:09:28,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-15 07:09:28,047 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 07:09:28,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:28,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125432748] [2022-04-15 07:09:28,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125432748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:28,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:28,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:28,354 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:28,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [738387022] [2022-04-15 07:09:28,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [738387022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:28,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:28,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 07:09:28,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083428904] [2022-04-15 07:09:28,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:28,355 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 47 [2022-04-15 07:09:28,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:28,355 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 07:09:28,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:28,387 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 07:09:28,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:28,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 07:09:28,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:09:28,388 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 07:09:29,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,559 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-15 07:09:29,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 07:09:29,559 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 47 [2022-04-15 07:09:29,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 07:09:29,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-04-15 07:09:29,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 07:09:29,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-04-15 07:09:29,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2022-04-15 07:09:29,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:29,625 INFO L225 Difference]: With dead ends: 65 [2022-04-15 07:09:29,625 INFO L226 Difference]: Without dead ends: 56 [2022-04-15 07:09:29,625 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:09:29,626 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:29,626 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [60 Valid, 107 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:09:29,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-15 07:09:29,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-04-15 07:09:29,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:29,635 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 07:09:29,635 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 07:09:29,635 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 07:09:29,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,636 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 07:09:29,636 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 07:09:29,636 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:29,636 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:29,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 56 states. [2022-04-15 07:09:29,636 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 56 states. [2022-04-15 07:09:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:29,637 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-15 07:09:29,637 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 07:09:29,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:29,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:29,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:29,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:29,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 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 07:09:29,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-15 07:09:29,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2022-04-15 07:09:29,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:29,638 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-15 07:09:29,638 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 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 07:09:29,638 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2022-04-15 07:09:29,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-15 07:09:29,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 07:09:29,699 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:29,699 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:29,699 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 07:09:29,699 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:29,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:29,699 INFO L85 PathProgramCache]: Analyzing trace with hash -993212297, now seen corresponding path program 16 times [2022-04-15 07:09:29,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:29,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2015525536] [2022-04-15 07:09:33,878 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:33,922 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:34,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:38,073 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:38,113 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:38,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:38,238 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:38,244 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:09:38,244 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:38,327 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:38,327 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:38,330 INFO L85 PathProgramCache]: Analyzing trace with hash 1695045903, now seen corresponding path program 1 times [2022-04-15 07:09:38,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:38,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115797807] [2022-04-15 07:09:38,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:38,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:38,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:38,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:38,373 INFO L290 TraceCheckUtils]: 0: Hoare triple {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5126#true} is VALID [2022-04-15 07:09:38,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {5126#true} assume true; {5126#true} is VALID [2022-04-15 07:09:38,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5126#true} {5126#true} #56#return; {5126#true} is VALID [2022-04-15 07:09:38,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {5126#true} call ULTIMATE.init(); {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:38,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5126#true} is VALID [2022-04-15 07:09:38,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {5126#true} assume true; {5126#true} is VALID [2022-04-15 07:09:38,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5126#true} {5126#true} #56#return; {5126#true} is VALID [2022-04-15 07:09:38,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {5126#true} call #t~ret7 := main(); {5126#true} is VALID [2022-04-15 07:09:38,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {5126#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5131#(= main_~a~0 0)} is VALID [2022-04-15 07:09:38,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {5131#(= main_~a~0 0)} [94] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse1 (= v_main_~c~0_934 v_main_~c~0_917)) (.cse2 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|)) (.cse3 (= |v_main_#t~pre5_336| |v_main_#t~pre5_333|))) (or (and (= v_main_~b~0_431 v_main_~b~0_427) .cse0 (= |v_main_#t~pre6_564| |v_main_#t~pre6_550|) .cse1 .cse2 .cse3) (and .cse0 (= |v_main_#t~pre6_550| |v_main_#t~pre6_564|) (= v_main_~b~0_427 v_main_~b~0_431) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_934, main_~b~0=v_main_~b~0_431, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_336|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_564|} OutVars{main_~c~0=v_main_~c~0_917, main_~b~0=v_main_~b~0_427, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_550|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5131#(= main_~a~0 0)} is VALID [2022-04-15 07:09:38,375 INFO L290 TraceCheckUtils]: 7: Hoare triple {5131#(= main_~a~0 0)} [93] L21-4_primed-->L21-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[] {5127#false} is VALID [2022-04-15 07:09:38,375 INFO L290 TraceCheckUtils]: 8: Hoare triple {5127#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5127#false} is VALID [2022-04-15 07:09:38,375 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#false} assume !false; {5127#false} is VALID [2022-04-15 07:09:38,375 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 07:09:38,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:38,376 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115797807] [2022-04-15 07:09:38,376 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115797807] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:38,376 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:38,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:38,711 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:38,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2015525536] [2022-04-15 07:09:38,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2015525536] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:38,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:38,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 07:09:38,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759906093] [2022-04-15 07:09:38,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:38,711 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 49 [2022-04-15 07:09:38,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:38,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 07:09:38,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:38,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 07:09:38,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:38,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 07:09:38,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:09:38,743 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 07:09:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:39,787 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-15 07:09:39,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 07:09:39,787 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 49 [2022-04-15 07:09:39,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:39,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 07:09:39,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-04-15 07:09:39,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 07:09:39,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-04-15 07:09:39,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 74 transitions. [2022-04-15 07:09:39,842 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:39,843 INFO L225 Difference]: With dead ends: 67 [2022-04-15 07:09:39,843 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 07:09:39,844 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1605, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:09:39,844 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:39,844 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 37 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:09:39,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 07:09:39,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-15 07:09:39,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:39,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 07:09:39,854 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 07:09:39,854 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 07:09:39,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:39,855 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 07:09:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 07:09:39,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:39,856 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:39,856 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 58 states. [2022-04-15 07:09:39,856 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 58 states. [2022-04-15 07:09:39,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:39,857 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-15 07:09:39,857 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 07:09:39,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:39,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:39,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:39,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:39,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 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 07:09:39,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-15 07:09:39,858 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-04-15 07:09:39,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:39,858 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-15 07:09:39,858 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 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 07:09:39,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-15 07:09:39,921 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 07:09:39,921 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-15 07:09:39,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 07:09:39,922 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:39,922 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:39,922 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 07:09:39,922 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:39,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:39,923 INFO L85 PathProgramCache]: Analyzing trace with hash -292770539, now seen corresponding path program 17 times [2022-04-15 07:09:39,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:39,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [263622776] [2022-04-15 07:09:42,472 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:42,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:42,600 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:45,256 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:45,303 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:45,383 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:45,427 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:45,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:09:45,433 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:45,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:45,549 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:45,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1695107407, now seen corresponding path program 1 times [2022-04-15 07:09:45,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:45,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919978979] [2022-04-15 07:09:45,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:45,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:45,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:45,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:45,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5548#true} is VALID [2022-04-15 07:09:45,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {5548#true} assume true; {5548#true} is VALID [2022-04-15 07:09:45,573 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5548#true} {5548#true} #56#return; {5548#true} is VALID [2022-04-15 07:09:45,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {5548#true} call ULTIMATE.init(); {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:45,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5548#true} is VALID [2022-04-15 07:09:45,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {5548#true} assume true; {5548#true} is VALID [2022-04-15 07:09:45,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5548#true} {5548#true} #56#return; {5548#true} is VALID [2022-04-15 07:09:45,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {5548#true} call #t~ret7 := main(); {5548#true} is VALID [2022-04-15 07:09:45,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {5548#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5553#(= main_~a~0 0)} is VALID [2022-04-15 07:09:45,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {5553#(= main_~a~0 0)} [96] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_363| |v_main_#t~pre5_360|) (= v_main_~a~0_118 v_main_~a~0_117) (= v_main_~b~0_466 v_main_~b~0_462) (= v_main_~c~0_1018 v_main_~c~0_1000) (= |v_main_#t~pre6_611| |v_main_#t~pre6_596|) (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) InVars {main_~c~0=v_main_~c~0_1018, main_~b~0=v_main_~b~0_466, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_363|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_611|} OutVars{main_~c~0=v_main_~c~0_1000, main_~b~0=v_main_~b~0_462, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_360|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_596|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5553#(= main_~a~0 0)} is VALID [2022-04-15 07:09:45,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {5553#(= main_~a~0 0)} [95] L21-4_primed-->L21-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[] {5549#false} is VALID [2022-04-15 07:09:45,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {5549#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5549#false} is VALID [2022-04-15 07:09:45,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {5549#false} assume !false; {5549#false} is VALID [2022-04-15 07:09:45,581 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 07:09:45,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:45,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919978979] [2022-04-15 07:09:45,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919978979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:45,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:45,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:45,913 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:45,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [263622776] [2022-04-15 07:09:45,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [263622776] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:45,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:45,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 07:09:45,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270846716] [2022-04-15 07:09:45,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:45,914 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 51 [2022-04-15 07:09:45,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:45,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 07:09:45,947 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:45,947 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 07:09:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 07:09:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:09:45,948 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 07:09:47,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:47,038 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-04-15 07:09:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 07:09:47,039 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 51 [2022-04-15 07:09:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:47,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 07:09:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-15 07:09:47,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 07:09:47,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-15 07:09:47,040 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2022-04-15 07:09:47,089 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:47,090 INFO L225 Difference]: With dead ends: 69 [2022-04-15 07:09:47,090 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 07:09:47,091 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=210, Invalid=1770, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:09:47,091 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:47,091 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 47 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:09:47,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 07:09:47,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-15 07:09:47,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:47,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 07:09:47,101 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 07:09:47,101 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 07:09:47,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:47,102 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 07:09:47,102 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 07:09:47,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:47,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:47,102 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 60 states. [2022-04-15 07:09:47,102 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 60 states. [2022-04-15 07:09:47,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:47,103 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-15 07:09:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 07:09:47,103 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:47,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:47,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:47,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:47,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 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 07:09:47,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-04-15 07:09:47,104 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2022-04-15 07:09:47,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:47,104 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-04-15 07:09:47,104 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 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 07:09:47,104 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2022-04-15 07:09:47,170 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 07:09:47,170 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-04-15 07:09:47,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 07:09:47,170 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:47,170 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:47,171 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 07:09:47,171 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:47,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:47,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1478106573, now seen corresponding path program 18 times [2022-04-15 07:09:47,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:47,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1421624009] [2022-04-15 07:09:51,333 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:51,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:51,479 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,570 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:53,618 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,748 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,869 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,992 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:53,992 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:53,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1695168911, now seen corresponding path program 1 times [2022-04-15 07:09:53,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:53,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452704590] [2022-04-15 07:09:53,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:53,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:54,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:54,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:54,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5985#true} is VALID [2022-04-15 07:09:54,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-15 07:09:54,014 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5985#true} {5985#true} #56#return; {5985#true} is VALID [2022-04-15 07:09:54,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:54,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5985#true} is VALID [2022-04-15 07:09:54,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-15 07:09:54,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #56#return; {5985#true} is VALID [2022-04-15 07:09:54,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret7 := main(); {5985#true} is VALID [2022-04-15 07:09:54,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5990#(= main_~a~0 0)} is VALID [2022-04-15 07:09:54,016 INFO L290 TraceCheckUtils]: 6: Hoare triple {5990#(= main_~a~0 0)} [98] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre6_664| |v_main_#t~pre6_648|)) (.cse2 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse3 (= v_main_~b~0_504 v_main_~b~0_500))) (or (and .cse0 .cse1 .cse2 (= v_main_~c~0_1109 v_main_~c~0_1090) .cse3 (= |v_main_#t~pre5_394| |v_main_#t~pre5_391|)) (and .cse0 (= |v_main_#t~pre5_391| |v_main_#t~pre5_394|) .cse1 (= v_main_~c~0_1090 v_main_~c~0_1109) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1109, main_~b~0=v_main_~b~0_504, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_394|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_664|} OutVars{main_~c~0=v_main_~c~0_1090, main_~b~0=v_main_~b~0_500, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_391|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_648|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5990#(= main_~a~0 0)} is VALID [2022-04-15 07:09:54,016 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(= main_~a~0 0)} [97] L21-4_primed-->L21-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[] {5986#false} is VALID [2022-04-15 07:09:54,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {5986#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5986#false} is VALID [2022-04-15 07:09:54,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-15 07:09:54,017 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 07:09:54,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:54,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452704590] [2022-04-15 07:09:54,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452704590] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:54,017 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:54,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:54,383 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:54,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1421624009] [2022-04-15 07:09:54,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1421624009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:54,384 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:54,384 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 07:09:54,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1661672636] [2022-04-15 07:09:54,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:54,384 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 53 [2022-04-15 07:09:54,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:54,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 07:09:54,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:54,426 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 07:09:54,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:54,426 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 07:09:54,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:09:54,427 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 07:09:55,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:55,783 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-15 07:09:55,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 07:09:55,783 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 53 [2022-04-15 07:09:55,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:55,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 07:09:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-15 07:09:55,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 07:09:55,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-15 07:09:55,790 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 78 transitions. [2022-04-15 07:09:55,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:55,845 INFO L225 Difference]: With dead ends: 71 [2022-04-15 07:09:55,845 INFO L226 Difference]: Without dead ends: 62 [2022-04-15 07:09:55,846 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=219, Invalid=1943, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:09:55,847 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:55,847 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 87 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:09:55,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-15 07:09:55,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2022-04-15 07:09:55,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:55,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 07:09:55,866 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 07:09:55,866 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 07:09:55,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:55,867 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 07:09:55,867 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 07:09:55,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:55,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:55,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 62 states. [2022-04-15 07:09:55,868 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 62 states. [2022-04-15 07:09:55,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:55,868 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-15 07:09:55,868 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 07:09:55,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:55,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:55,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:55,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:55,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 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 07:09:55,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-15 07:09:55,869 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2022-04-15 07:09:55,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:55,869 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-15 07:09:55,870 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 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 07:09:55,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 58 transitions. [2022-04-15 07:09:55,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:55,948 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-15 07:09:55,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 07:09:55,948 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:55,948 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:55,948 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 07:09:55,948 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:55,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:55,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1875265489, now seen corresponding path program 19 times [2022-04-15 07:09:55,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:55,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [649635923] [2022-04-15 07:10:00,132 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:00,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:00,262 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:04,362 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:04,410 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:04,500 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:04,542 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:04,548 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:04,548 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:04,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:04,660 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1695230415, now seen corresponding path program 1 times [2022-04-15 07:10:04,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:04,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481187516] [2022-04-15 07:10:04,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:04,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:04,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:04,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6437#true} is VALID [2022-04-15 07:10:04,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {6437#true} assume true; {6437#true} is VALID [2022-04-15 07:10:04,696 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6437#true} {6437#true} #56#return; {6437#true} is VALID [2022-04-15 07:10:04,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {6437#true} call ULTIMATE.init(); {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:04,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6437#true} is VALID [2022-04-15 07:10:04,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {6437#true} assume true; {6437#true} is VALID [2022-04-15 07:10:04,697 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6437#true} {6437#true} #56#return; {6437#true} is VALID [2022-04-15 07:10:04,697 INFO L272 TraceCheckUtils]: 4: Hoare triple {6437#true} call #t~ret7 := main(); {6437#true} is VALID [2022-04-15 07:10:04,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6442#(= main_~a~0 0)} is VALID [2022-04-15 07:10:04,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {6442#(= main_~a~0 0)} [100] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_715| |v_main_#t~pre6_698|)) (.cse1 (= v_main_~b~0_539 v_main_~b~0_535)) (.cse2 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse3 (= v_main_~c~0_1199 v_main_~c~0_1179))) (or (and .cse0 (= |v_main_#t~pre5_418| |v_main_#t~pre5_421|) .cse1 (= v_main_~a~0_129 v_main_~a~0_130) .cse2 .cse3) (and (= |v_main_#t~pre5_421| |v_main_#t~pre5_418|) .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_130 v_main_~a~0_129)))) InVars {main_~c~0=v_main_~c~0_1199, main_~b~0=v_main_~b~0_539, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_421|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_715|} OutVars{main_~c~0=v_main_~c~0_1179, main_~b~0=v_main_~b~0_535, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_418|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_698|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6442#(= main_~a~0 0)} is VALID [2022-04-15 07:10:04,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {6442#(= main_~a~0 0)} [99] L21-4_primed-->L21-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[] {6438#false} is VALID [2022-04-15 07:10:04,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {6438#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6438#false} is VALID [2022-04-15 07:10:04,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#false} assume !false; {6438#false} is VALID [2022-04-15 07:10:04,699 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 07:10:04,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:04,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481187516] [2022-04-15 07:10:04,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481187516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:04,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:04,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:05,115 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:05,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [649635923] [2022-04-15 07:10:05,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [649635923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:05,115 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:05,115 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 07:10:05,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955833451] [2022-04-15 07:10:05,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:05,116 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 55 [2022-04-15 07:10:05,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:05,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 07:10:05,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:05,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 07:10:05,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:05,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 07:10:05,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:10:05,150 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 07:10:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:06,669 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-15 07:10:06,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 07:10:06,670 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 55 [2022-04-15 07:10:06,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 07:10:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-15 07:10:06,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 07:10:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-15 07:10:06,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-15 07:10:06,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:06,735 INFO L225 Difference]: With dead ends: 75 [2022-04-15 07:10:06,735 INFO L226 Difference]: Without dead ends: 66 [2022-04-15 07:10:06,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=2124, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 07:10:06,736 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:06,737 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 87 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:10:06,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-15 07:10:06,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-04-15 07:10:06,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:06,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 07:10:06,749 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 07:10:06,749 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 07:10:06,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:06,750 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 07:10:06,750 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 07:10:06,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:06,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:06,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 66 states. [2022-04-15 07:10:06,750 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 66 states. [2022-04-15 07:10:06,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:06,751 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-15 07:10:06,751 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 07:10:06,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:06,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:06,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:06,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:06,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 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 07:10:06,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-15 07:10:06,752 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-15 07:10:06,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:06,752 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-15 07:10:06,752 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 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 07:10:06,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-15 07:10:06,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:06,852 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-15 07:10:06,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 07:10:06,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:06,852 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:06,853 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 07:10:06,853 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:06,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:06,853 INFO L85 PathProgramCache]: Analyzing trace with hash -1054622225, now seen corresponding path program 20 times [2022-04-15 07:10:06,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:06,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1640069683] [2022-04-15 07:10:11,030 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:11,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:11,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:13,816 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:13,861 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:13,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:13,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:13,963 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:14,082 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:14,082 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:14,083 INFO L85 PathProgramCache]: Analyzing trace with hash 1695291919, now seen corresponding path program 1 times [2022-04-15 07:10:14,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:14,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58434756] [2022-04-15 07:10:14,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:14,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:14,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:14,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:14,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6916#true} is VALID [2022-04-15 07:10:14,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {6916#true} assume true; {6916#true} is VALID [2022-04-15 07:10:14,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6916#true} {6916#true} #56#return; {6916#true} is VALID [2022-04-15 07:10:14,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {6916#true} call ULTIMATE.init(); {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:14,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6916#true} is VALID [2022-04-15 07:10:14,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {6916#true} assume true; {6916#true} is VALID [2022-04-15 07:10:14,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6916#true} {6916#true} #56#return; {6916#true} is VALID [2022-04-15 07:10:14,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {6916#true} call #t~ret7 := main(); {6916#true} is VALID [2022-04-15 07:10:14,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {6916#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6921#(= main_~a~0 0)} is VALID [2022-04-15 07:10:14,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {6921#(= main_~a~0 0)} [102] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_136 v_main_~a~0_135)) (.cse1 (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|)) (.cse2 (= |v_main_#t~pre6_757| |v_main_#t~pre6_739|)) (.cse3 (= v_main_~b~0_567 v_main_~b~0_563)) (.cse4 (= v_main_~c~0_1280 v_main_~c~0_1259))) (or (and (= |v_main_#t~pre5_439| |v_main_#t~pre5_442|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |v_main_#t~pre5_442| |v_main_#t~pre5_439|) .cse0 .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1280, main_~b~0=v_main_~b~0_567, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_442|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_757|} OutVars{main_~c~0=v_main_~c~0_1259, main_~b~0=v_main_~b~0_563, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_439|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_739|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6921#(= main_~a~0 0)} is VALID [2022-04-15 07:10:14,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {6921#(= main_~a~0 0)} [101] L21-4_primed-->L21-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[] {6917#false} is VALID [2022-04-15 07:10:14,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {6917#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6917#false} is VALID [2022-04-15 07:10:14,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {6917#false} assume !false; {6917#false} is VALID [2022-04-15 07:10:14,126 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 07:10:14,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:14,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58434756] [2022-04-15 07:10:14,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58434756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:14,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:14,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:14,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:14,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1640069683] [2022-04-15 07:10:14,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1640069683] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:14,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:14,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 07:10:14,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688773829] [2022-04-15 07:10:14,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:14,558 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 57 [2022-04-15 07:10:14,558 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:14,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 07:10:14,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:14,595 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 07:10:14,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:14,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 07:10:14,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:10:14,595 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 07:10:16,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,032 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-15 07:10:16,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 07:10:16,032 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 57 [2022-04-15 07:10:16,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 07:10:16,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 83 transitions. [2022-04-15 07:10:16,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 07:10:16,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 83 transitions. [2022-04-15 07:10:16,035 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 83 transitions. [2022-04-15 07:10:16,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:16,103 INFO L225 Difference]: With dead ends: 76 [2022-04-15 07:10:16,103 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 07:10:16,103 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=237, Invalid=2313, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 07:10:16,104 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:16,104 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 72 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:10:16,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 07:10:16,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-15 07:10:16,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:16,117 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 07:10:16,117 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 07:10:16,117 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 07:10:16,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,118 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 07:10:16,118 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 07:10:16,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:16,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:16,119 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 67 states. [2022-04-15 07:10:16,119 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 67 states. [2022-04-15 07:10:16,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,120 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-15 07:10:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-15 07:10:16,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:16,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:16,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:16,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:16,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 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 07:10:16,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-15 07:10:16,121 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2022-04-15 07:10:16,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:16,121 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-15 07:10:16,121 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 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 07:10:16,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2022-04-15 07:10:16,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:16,201 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-15 07:10:16,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 07:10:16,201 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:16,202 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:16,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 07:10:16,202 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:16,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:16,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1523469894, now seen corresponding path program 21 times [2022-04-15 07:10:16,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:16,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [763183136] [2022-04-15 07:10:16,414 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:16,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:16,613 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:16,702 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:16,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:16,878 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:17,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:17,002 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:17,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1695353423, now seen corresponding path program 1 times [2022-04-15 07:10:17,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:17,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864466330] [2022-04-15 07:10:17,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:17,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:17,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7406#true} is VALID [2022-04-15 07:10:17,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {7406#true} assume true; {7406#true} is VALID [2022-04-15 07:10:17,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7406#true} {7406#true} #56#return; {7406#true} is VALID [2022-04-15 07:10:17,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {7406#true} call ULTIMATE.init(); {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:17,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7406#true} is VALID [2022-04-15 07:10:17,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {7406#true} assume true; {7406#true} is VALID [2022-04-15 07:10:17,030 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7406#true} {7406#true} #56#return; {7406#true} is VALID [2022-04-15 07:10:17,030 INFO L272 TraceCheckUtils]: 4: Hoare triple {7406#true} call #t~ret7 := main(); {7406#true} is VALID [2022-04-15 07:10:17,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {7406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7411#(= main_~a~0 0)} is VALID [2022-04-15 07:10:17,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {7411#(= main_~a~0 0)} [104] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_474| |v_main_#t~pre5_470|)) (.cse1 (= |v_main_#t~pre6_803| |v_main_#t~pre6_785|)) (.cse2 (= v_main_~c~0_1373 v_main_~c~0_1351)) (.cse3 (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|)) (.cse4 (= v_main_~a~0_142 v_main_~a~0_141))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_602 v_main_~b~0_607)) (and .cse0 .cse1 .cse2 (= v_main_~b~0_607 v_main_~b~0_602) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1373, main_~b~0=v_main_~b~0_607, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_474|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_803|} OutVars{main_~c~0=v_main_~c~0_1351, main_~b~0=v_main_~b~0_602, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_470|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_785|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7411#(= main_~a~0 0)} is VALID [2022-04-15 07:10:17,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {7411#(= main_~a~0 0)} [103] L21-4_primed-->L21-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[] {7407#false} is VALID [2022-04-15 07:10:17,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {7407#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7407#false} is VALID [2022-04-15 07:10:17,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {7407#false} assume !false; {7407#false} is VALID [2022-04-15 07:10:17,032 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 07:10:17,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:17,032 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864466330] [2022-04-15 07:10:17,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864466330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:17,032 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:17,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:17,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:17,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [763183136] [2022-04-15 07:10:17,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [763183136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:17,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:17,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 07:10:17,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669006793] [2022-04-15 07:10:17,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:17,456 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-15 07:10:17,456 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:17,456 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:10:17,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:17,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 07:10:17,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:17,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 07:10:17,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-04-15 07:10:17,495 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:10:19,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,105 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-04-15 07:10:19,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 07:10:19,105 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 60 [2022-04-15 07:10:19,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:19,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:10:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 07:10:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:10:19,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-15 07:10:19,107 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 85 transitions. [2022-04-15 07:10:19,171 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 07:10:19,172 INFO L225 Difference]: With dead ends: 78 [2022-04-15 07:10:19,172 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 07:10:19,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=2510, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:10:19,173 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:19,173 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 07:10:19,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 07:10:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-04-15 07:10:19,186 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:19,186 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 07:10:19,186 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 07:10:19,186 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 07:10:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,187 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 07:10:19,187 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 07:10:19,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:19,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:19,188 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 69 states. [2022-04-15 07:10:19,188 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 69 states. [2022-04-15 07:10:19,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,188 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-15 07:10:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-15 07:10:19,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:19,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:19,189 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:19,189 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:19,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 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 07:10:19,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-15 07:10:19,189 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2022-04-15 07:10:19,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:19,190 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-15 07:10:19,190 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 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 07:10:19,190 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-15 07:10:19,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:19,272 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-15 07:10:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 07:10:19,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:19,276 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:19,277 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 07:10:19,277 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:19,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:19,277 INFO L85 PathProgramCache]: Analyzing trace with hash 172227364, now seen corresponding path program 22 times [2022-04-15 07:10:19,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:19,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599216704] [2022-04-15 07:10:19,464 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,735 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,779 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,785 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:19,785 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:19,912 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:19,912 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:19,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1695414927, now seen corresponding path program 1 times [2022-04-15 07:10:19,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:19,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065996647] [2022-04-15 07:10:19,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:19,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:19,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:19,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7909#true} is VALID [2022-04-15 07:10:19,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-15 07:10:19,951 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7909#true} {7909#true} #56#return; {7909#true} is VALID [2022-04-15 07:10:19,952 INFO L272 TraceCheckUtils]: 0: Hoare triple {7909#true} call ULTIMATE.init(); {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:19,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7909#true} is VALID [2022-04-15 07:10:19,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-15 07:10:19,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7909#true} {7909#true} #56#return; {7909#true} is VALID [2022-04-15 07:10:19,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {7909#true} call #t~ret7 := main(); {7909#true} is VALID [2022-04-15 07:10:19,954 INFO L290 TraceCheckUtils]: 5: Hoare triple {7909#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7914#(= main_~a~0 0)} is VALID [2022-04-15 07:10:19,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {7914#(= main_~a~0 0)} [106] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_502| |v_main_#t~pre5_498|) (= v_main_~a~0_148 v_main_~a~0_147) (= v_main_~c~0_1465 v_main_~c~0_1442) (= |v_main_#t~pre6_852| |v_main_#t~pre6_833|) (= v_main_~b~0_644 v_main_~b~0_639) (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|)) InVars {main_~c~0=v_main_~c~0_1465, main_~b~0=v_main_~b~0_644, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_502|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_852|} OutVars{main_~c~0=v_main_~c~0_1442, main_~b~0=v_main_~b~0_639, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_498|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_833|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7914#(= main_~a~0 0)} is VALID [2022-04-15 07:10:19,955 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(= main_~a~0 0)} [105] L21-4_primed-->L21-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[] {7910#false} is VALID [2022-04-15 07:10:19,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {7910#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7910#false} is VALID [2022-04-15 07:10:19,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-15 07:10:19,955 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 07:10:19,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:19,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065996647] [2022-04-15 07:10:19,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065996647] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:19,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:19,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:20,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599216704] [2022-04-15 07:10:20,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599216704] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:20,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:20,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 07:10:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048403073] [2022-04-15 07:10:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:20,444 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 62 [2022-04-15 07:10:20,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:20,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 07:10:20,483 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:20,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 07:10:20,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:20,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 07:10:20,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:10:20,484 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 07:10:22,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:22,399 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-04-15 07:10:22,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 07:10:22,399 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 62 [2022-04-15 07:10:22,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:22,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 07:10:22,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-15 07:10:22,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 07:10:22,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-15 07:10:22,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 87 transitions. [2022-04-15 07:10:22,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:22,478 INFO L225 Difference]: With dead ends: 80 [2022-04-15 07:10:22,478 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 07:10:22,479 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=2715, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 07:10:22,479 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:22,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 62 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:10:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 07:10:22,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-04-15 07:10:22,494 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:22,495 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 07:10:22,495 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 07:10:22,495 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 07:10:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:22,496 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 07:10:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 07:10:22,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:22,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:22,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 71 states. [2022-04-15 07:10:22,496 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 71 states. [2022-04-15 07:10:22,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:22,497 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-15 07:10:22,497 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-15 07:10:22,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:22,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:22,497 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:22,498 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:22,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 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 07:10:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-15 07:10:22,498 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2022-04-15 07:10:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:22,499 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-15 07:10:22,499 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 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 07:10:22,499 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-15 07:10:22,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:22,583 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-15 07:10:22,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 07:10:22,583 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:22,583 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:22,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 07:10:22,583 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:22,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:22,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1291720574, now seen corresponding path program 23 times [2022-04-15 07:10:22,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:22,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939814248] [2022-04-15 07:10:22,807 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:22,888 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,000 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,088 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,138 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:23,138 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:23,249 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:23,250 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1695476431, now seen corresponding path program 1 times [2022-04-15 07:10:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:23,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478289752] [2022-04-15 07:10:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:23,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:23,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:23,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:23,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:23,307 INFO L290 TraceCheckUtils]: 0: Hoare triple {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8427#true} is VALID [2022-04-15 07:10:23,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-04-15 07:10:23,308 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8427#true} {8427#true} #56#return; {8427#true} is VALID [2022-04-15 07:10:23,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {8427#true} call ULTIMATE.init(); {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:23,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8427#true} is VALID [2022-04-15 07:10:23,308 INFO L290 TraceCheckUtils]: 2: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-04-15 07:10:23,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8427#true} {8427#true} #56#return; {8427#true} is VALID [2022-04-15 07:10:23,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {8427#true} call #t~ret7 := main(); {8427#true} is VALID [2022-04-15 07:10:23,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {8427#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {8432#(= main_~a~0 0)} is VALID [2022-04-15 07:10:23,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {8432#(= main_~a~0 0)} [108] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_530| |v_main_#t~pre5_526|) (= v_main_~c~0_1560 v_main_~c~0_1536) (= v_main_~b~0_681 v_main_~b~0_676) (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|) (= |v_main_#t~pre6_903| |v_main_#t~pre6_883|) (= v_main_~a~0_154 v_main_~a~0_153)) InVars {main_~c~0=v_main_~c~0_1560, main_~b~0=v_main_~b~0_681, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_530|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_903|} OutVars{main_~c~0=v_main_~c~0_1536, main_~b~0=v_main_~b~0_676, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_526|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_883|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8432#(= main_~a~0 0)} is VALID [2022-04-15 07:10:23,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {8432#(= main_~a~0 0)} [107] L21-4_primed-->L21-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[] {8428#false} is VALID [2022-04-15 07:10:23,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {8428#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {8428#false} is VALID [2022-04-15 07:10:23,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {8428#false} assume !false; {8428#false} is VALID [2022-04-15 07:10:23,310 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 07:10:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:23,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478289752] [2022-04-15 07:10:23,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478289752] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:23,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:23,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:23,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:23,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939814248] [2022-04-15 07:10:23,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939814248] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:23,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:23,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 07:10:23,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094148191] [2022-04-15 07:10:23,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:23,876 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 64 [2022-04-15 07:10:23,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:23,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 07:10:23,916 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:23,916 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 07:10:23,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:23,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 07:10:23,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:10:23,917 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 07:10:25,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:25,756 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-04-15 07:10:25,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 07:10:25,756 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 64 [2022-04-15 07:10:25,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 07:10:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-15 07:10:25,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 07:10:25,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-15 07:10:25,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 89 transitions. [2022-04-15 07:10:25,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:25,817 INFO L225 Difference]: With dead ends: 82 [2022-04-15 07:10:25,817 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:10:25,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=264, Invalid=2928, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:10:25,818 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:25,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [85 Valid, 32 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 07:10:25,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:10:25,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-15 07:10:25,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:25,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 07:10:25,832 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 07:10:25,833 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 07:10:25,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:25,833 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 07:10:25,833 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-15 07:10:25,834 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:25,834 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:25,834 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 73 states. [2022-04-15 07:10:25,834 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 73 states. [2022-04-15 07:10:25,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:25,835 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-15 07:10:25,835 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-15 07:10:25,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:25,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:25,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:25,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:25,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 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 07:10:25,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-15 07:10:25,836 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2022-04-15 07:10:25,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:25,836 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-15 07:10:25,836 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 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 07:10:25,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-15 07:10:25,929 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 07:10:25,930 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-15 07:10:25,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 07:10:25,930 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:25,930 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:25,930 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 07:10:25,930 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:25,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:25,930 INFO L85 PathProgramCache]: Analyzing trace with hash 603584096, now seen corresponding path program 24 times [2022-04-15 07:10:25,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:25,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1912186688] [2022-04-15 07:10:26,146 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,345 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,426 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,476 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:26,476 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:26,612 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:26,612 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:26,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1695537935, now seen corresponding path program 1 times [2022-04-15 07:10:26,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:26,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385513758] [2022-04-15 07:10:26,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:26,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:26,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:26,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:26,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:26,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8960#true} is VALID [2022-04-15 07:10:26,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {8960#true} assume true; {8960#true} is VALID [2022-04-15 07:10:26,647 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8960#true} {8960#true} #56#return; {8960#true} is VALID [2022-04-15 07:10:26,648 INFO L272 TraceCheckUtils]: 0: Hoare triple {8960#true} call ULTIMATE.init(); {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:26,648 INFO L290 TraceCheckUtils]: 1: Hoare triple {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8960#true} is VALID [2022-04-15 07:10:26,648 INFO L290 TraceCheckUtils]: 2: Hoare triple {8960#true} assume true; {8960#true} is VALID [2022-04-15 07:10:26,648 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8960#true} {8960#true} #56#return; {8960#true} is VALID [2022-04-15 07:10:26,648 INFO L272 TraceCheckUtils]: 4: Hoare triple {8960#true} call #t~ret7 := main(); {8960#true} is VALID [2022-04-15 07:10:26,648 INFO L290 TraceCheckUtils]: 5: Hoare triple {8960#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {8965#(= main_~a~0 0)} is VALID [2022-04-15 07:10:26,649 INFO L290 TraceCheckUtils]: 6: Hoare triple {8965#(= main_~a~0 0)} [110] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse1 (= |v_main_#t~pre5_558| |v_main_#t~pre5_554|)) (.cse2 (= |v_main_#t~pre6_956| |v_main_#t~pre6_935|)) (.cse3 (= v_main_~c~0_1658 v_main_~c~0_1633))) (or (and .cse0 (= v_main_~b~0_713 v_main_~b~0_718) (= v_main_~a~0_159 v_main_~a~0_160) .cse1 .cse2 .cse3) (and .cse0 (= v_main_~b~0_718 v_main_~b~0_713) (= v_main_~a~0_160 v_main_~a~0_159) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1658, main_~b~0=v_main_~b~0_718, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_558|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_956|} OutVars{main_~c~0=v_main_~c~0_1633, main_~b~0=v_main_~b~0_713, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_554|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_935|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8965#(= main_~a~0 0)} is VALID [2022-04-15 07:10:26,649 INFO L290 TraceCheckUtils]: 7: Hoare triple {8965#(= main_~a~0 0)} [109] L21-4_primed-->L21-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[] {8961#false} is VALID [2022-04-15 07:10:26,649 INFO L290 TraceCheckUtils]: 8: Hoare triple {8961#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {8961#false} is VALID [2022-04-15 07:10:26,649 INFO L290 TraceCheckUtils]: 9: Hoare triple {8961#false} assume !false; {8961#false} is VALID [2022-04-15 07:10:26,649 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 07:10:26,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:26,650 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385513758] [2022-04-15 07:10:26,650 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385513758] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:26,650 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:26,650 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:27,260 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:27,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1912186688] [2022-04-15 07:10:27,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1912186688] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:27,260 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:27,260 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 07:10:27,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28883839] [2022-04-15 07:10:27,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:27,261 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 66 [2022-04-15 07:10:27,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:27,261 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 07:10:27,309 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:27,309 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 07:10:27,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:27,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 07:10:27,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:10:27,310 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 07:10:29,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:29,579 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-04-15 07:10:29,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 07:10:29,580 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 66 [2022-04-15 07:10:29,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:29,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 07:10:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-15 07:10:29,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 07:10:29,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-15 07:10:29,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 91 transitions. [2022-04-15 07:10:29,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:29,668 INFO L225 Difference]: With dead ends: 84 [2022-04-15 07:10:29,668 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 07:10:29,670 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=3149, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 07:10:29,670 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:29,670 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [87 Valid, 117 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:10:29,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 07:10:29,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2022-04-15 07:10:29,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:29,687 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 07:10:29,688 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 07:10:29,688 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 07:10:29,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:29,689 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-15 07:10:29,689 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-15 07:10:29,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:29,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:29,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 75 states. [2022-04-15 07:10:29,689 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 75 states. [2022-04-15 07:10:29,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:29,690 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-15 07:10:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-15 07:10:29,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:29,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:29,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:29,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:29,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 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 07:10:29,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-15 07:10:29,691 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2022-04-15 07:10:29,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:29,691 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-15 07:10:29,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 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 07:10:29,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-15 07:10:29,783 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 07:10:29,784 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-15 07:10:29,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-15 07:10:29,784 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:29,784 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:29,784 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 07:10:29,784 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:29,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:29,784 INFO L85 PathProgramCache]: Analyzing trace with hash 925238462, now seen corresponding path program 25 times [2022-04-15 07:10:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1808715073] [2022-04-15 07:10:32,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:32,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,192 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:36,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,362 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,613 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:36,613 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:36,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1695599439, now seen corresponding path program 1 times [2022-04-15 07:10:36,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:36,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855689997] [2022-04-15 07:10:36,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:36,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:36,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:36,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:36,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9508#true} is VALID [2022-04-15 07:10:36,636 INFO L290 TraceCheckUtils]: 1: Hoare triple {9508#true} assume true; {9508#true} is VALID [2022-04-15 07:10:36,636 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9508#true} {9508#true} #56#return; {9508#true} is VALID [2022-04-15 07:10:36,637 INFO L272 TraceCheckUtils]: 0: Hoare triple {9508#true} call ULTIMATE.init(); {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:36,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9508#true} is VALID [2022-04-15 07:10:36,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {9508#true} assume true; {9508#true} is VALID [2022-04-15 07:10:36,637 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9508#true} {9508#true} #56#return; {9508#true} is VALID [2022-04-15 07:10:36,637 INFO L272 TraceCheckUtils]: 4: Hoare triple {9508#true} call #t~ret7 := main(); {9508#true} is VALID [2022-04-15 07:10:36,637 INFO L290 TraceCheckUtils]: 5: Hoare triple {9508#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {9513#(= main_~a~0 0)} is VALID [2022-04-15 07:10:36,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {9513#(= main_~a~0 0)} [112] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_758 v_main_~b~0_753) (= |v_main_#t~pre5_590| |v_main_#t~pre5_586|) (= v_main_~c~0_1763 v_main_~c~0_1737) (= v_main_~a~0_166 v_main_~a~0_165) (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|) (= |v_main_#t~pre6_1015| |v_main_#t~pre6_993|)) InVars {main_~c~0=v_main_~c~0_1763, main_~b~0=v_main_~b~0_758, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_590|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_1015|} OutVars{main_~c~0=v_main_~c~0_1737, main_~b~0=v_main_~b~0_753, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_586|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_993|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9513#(= main_~a~0 0)} is VALID [2022-04-15 07:10:36,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {9513#(= main_~a~0 0)} [111] L21-4_primed-->L21-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[] {9509#false} is VALID [2022-04-15 07:10:36,638 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {9509#false} is VALID [2022-04-15 07:10:36,638 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#false} assume !false; {9509#false} is VALID [2022-04-15 07:10:36,638 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 07:10:36,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:36,638 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855689997] [2022-04-15 07:10:36,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855689997] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:36,639 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:36,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:37,185 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:37,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1808715073] [2022-04-15 07:10:37,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1808715073] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:37,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:37,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 07:10:37,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380741840] [2022-04-15 07:10:37,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:37,186 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 68 [2022-04-15 07:10:37,186 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:37,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 07:10:37,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:37,227 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 07:10:37,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 07:10:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:10:37,227 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 07:10:39,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:39,284 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-15 07:10:39,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 07:10:39,285 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 68 [2022-04-15 07:10:39,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:39,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 07:10:39,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 93 transitions. [2022-04-15 07:10:39,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 07:10:39,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 93 transitions. [2022-04-15 07:10:39,286 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 93 transitions. [2022-04-15 07:10:39,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:39,366 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:10:39,366 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 07:10:39,367 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=282, Invalid=3378, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 07:10:39,371 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:39,371 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 57 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:10:39,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 07:10:39,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-04-15 07:10:39,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:39,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 07:10:39,388 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 07:10:39,388 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 07:10:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:39,389 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 07:10:39,389 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-15 07:10:39,389 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:39,389 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:39,389 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 77 states. [2022-04-15 07:10:39,389 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 77 states. [2022-04-15 07:10:39,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:39,390 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-15 07:10:39,390 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-15 07:10:39,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:39,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:39,390 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:39,390 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:39,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 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 07:10:39,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-15 07:10:39,392 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2022-04-15 07:10:39,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:39,393 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-15 07:10:39,393 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 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 07:10:39,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-15 07:10:39,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:39,489 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-15 07:10:39,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 07:10:39,489 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:39,489 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:39,490 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 07:10:39,490 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:39,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:39,490 INFO L85 PathProgramCache]: Analyzing trace with hash 797438876, now seen corresponding path program 26 times [2022-04-15 07:10:39,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:39,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883048361] [2022-04-15 07:10:43,663 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:43,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:43,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,479 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:47,518 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,602 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,649 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,655 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:47,656 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:47,794 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:47,794 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:47,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1695660943, now seen corresponding path program 1 times [2022-04-15 07:10:47,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:47,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205901351] [2022-04-15 07:10:47,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:47,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:47,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:47,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:47,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10071#true} is VALID [2022-04-15 07:10:47,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {10071#true} assume true; {10071#true} is VALID [2022-04-15 07:10:47,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10071#true} {10071#true} #56#return; {10071#true} is VALID [2022-04-15 07:10:47,825 INFO L272 TraceCheckUtils]: 0: Hoare triple {10071#true} call ULTIMATE.init(); {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:47,825 INFO L290 TraceCheckUtils]: 1: Hoare triple {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10071#true} is VALID [2022-04-15 07:10:47,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {10071#true} assume true; {10071#true} is VALID [2022-04-15 07:10:47,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10071#true} {10071#true} #56#return; {10071#true} is VALID [2022-04-15 07:10:47,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {10071#true} call #t~ret7 := main(); {10071#true} is VALID [2022-04-15 07:10:47,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {10071#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10076#(= main_~a~0 0)} is VALID [2022-04-15 07:10:47,828 INFO L290 TraceCheckUtils]: 6: Hoare triple {10076#(= main_~a~0 0)} [114] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1867 v_main_~c~0_1840)) (.cse1 (= v_main_~b~0_795 v_main_~b~0_790)) (.cse2 (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|)) (.cse3 (= v_main_~a~0_172 v_main_~a~0_171)) (.cse4 (= |v_main_#t~pre6_1072| |v_main_#t~pre6_1049|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_618| |v_main_#t~pre5_614|) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_614| |v_main_#t~pre5_618|) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1867, main_~b~0=v_main_~b~0_795, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_618|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_1072|} OutVars{main_~c~0=v_main_~c~0_1840, main_~b~0=v_main_~b~0_790, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_614|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_1049|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10076#(= main_~a~0 0)} is VALID [2022-04-15 07:10:47,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {10076#(= main_~a~0 0)} [113] L21-4_primed-->L21-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[] {10072#false} is VALID [2022-04-15 07:10:47,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10072#false} is VALID [2022-04-15 07:10:47,829 INFO L290 TraceCheckUtils]: 9: Hoare triple {10072#false} assume !false; {10072#false} is VALID [2022-04-15 07:10:47,829 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 07:10:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:47,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205901351] [2022-04-15 07:10:47,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205901351] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:47,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:47,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:48,538 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:48,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883048361] [2022-04-15 07:10:48,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883048361] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:48,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:48,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 07:10:48,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551630540] [2022-04-15 07:10:48,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:48,539 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 70 [2022-04-15 07:10:48,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:48,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 07:10:48,583 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 07:10:48,583 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 07:10:48,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:48,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 07:10:48,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:10:48,584 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 07:10:51,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:51,205 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-15 07:10:51,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 07:10:51,205 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 70 [2022-04-15 07:10:51,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:51,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 07:10:51,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 98 transitions. [2022-04-15 07:10:51,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 07:10:51,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 98 transitions. [2022-04-15 07:10:51,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 98 transitions. [2022-04-15 07:10:51,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:51,319 INFO L225 Difference]: With dead ends: 90 [2022-04-15 07:10:51,319 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:10:51,320 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 18 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=291, Invalid=3615, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:10:51,320 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:51,320 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 142 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:10:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:10:51,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2022-04-15 07:10:51,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:51,339 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 07:10:51,339 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 07:10:51,339 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 07:10:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:51,340 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 07:10:51,340 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 07:10:51,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:51,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:51,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 81 states. [2022-04-15 07:10:51,341 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 81 states. [2022-04-15 07:10:51,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:51,342 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-15 07:10:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-15 07:10:51,342 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:51,342 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:51,342 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:51,342 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:51,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 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 07:10:51,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-15 07:10:51,343 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 70 [2022-04-15 07:10:51,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:51,344 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-15 07:10:51,344 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 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 07:10:51,344 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-15 07:10:51,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:10:51,448 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-15 07:10:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-15 07:10:51,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:51,449 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:51,449 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 07:10:51,449 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:51,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:51,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1758878982, now seen corresponding path program 27 times [2022-04-15 07:10:51,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:51,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1130767810] [2022-04-15 07:10:55,634 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:55,681 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:55,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,850 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:59,896 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,976 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:59,998 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:10:59,998 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:00,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:00,135 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:00,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1695722447, now seen corresponding path program 1 times [2022-04-15 07:11:00,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:00,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407637097] [2022-04-15 07:11:00,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:00,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:00,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:00,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:00,164 INFO L290 TraceCheckUtils]: 0: Hoare triple {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10661#true} is VALID [2022-04-15 07:11:00,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {10661#true} assume true; {10661#true} is VALID [2022-04-15 07:11:00,164 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10661#true} {10661#true} #56#return; {10661#true} is VALID [2022-04-15 07:11:00,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {10661#true} call ULTIMATE.init(); {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:00,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10661#true} is VALID [2022-04-15 07:11:00,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {10661#true} assume true; {10661#true} is VALID [2022-04-15 07:11:00,165 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10661#true} {10661#true} #56#return; {10661#true} is VALID [2022-04-15 07:11:00,165 INFO L272 TraceCheckUtils]: 4: Hoare triple {10661#true} call #t~ret7 := main(); {10661#true} is VALID [2022-04-15 07:11:00,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {10661#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10666#(= main_~a~0 0)} is VALID [2022-04-15 07:11:00,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {10666#(= main_~a~0 0)} [116] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_825 v_main_~b~0_820)) (.cse1 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse2 (= |v_main_#t~pre6_1120| |v_main_#t~pre6_1096|)) (.cse3 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 (= v_main_~c~0_1962 v_main_~c~0_1934) (= |v_main_#t~pre5_640| |v_main_#t~pre5_636|) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= v_main_~c~0_1934 v_main_~c~0_1962) (= |v_main_#t~pre5_636| |v_main_#t~pre5_640|) .cse3))) InVars {main_~c~0=v_main_~c~0_1962, main_~b~0=v_main_~b~0_825, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_640|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_1120|} OutVars{main_~c~0=v_main_~c~0_1934, main_~b~0=v_main_~b~0_820, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_636|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_1096|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10666#(= main_~a~0 0)} is VALID [2022-04-15 07:11:00,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {10666#(= main_~a~0 0)} [115] L21-4_primed-->L21-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[] {10662#false} is VALID [2022-04-15 07:11:00,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {10662#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10662#false} is VALID [2022-04-15 07:11:00,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {10662#false} assume !false; {10662#false} is VALID [2022-04-15 07:11:00,169 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 07:11:00,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:00,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407637097] [2022-04-15 07:11:00,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407637097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:00,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:00,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:00,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:00,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1130767810] [2022-04-15 07:11:00,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1130767810] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:00,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:00,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 07:11:00,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633938576] [2022-04-15 07:11:00,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:00,820 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 72 [2022-04-15 07:11:00,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:00,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 07:11:00,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:00,865 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 07:11:00,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:00,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 07:11:00,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 07:11:00,866 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 07:11:03,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:03,695 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-15 07:11:03,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 07:11:03,695 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 72 [2022-04-15 07:11:03,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 07:11:03,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2022-04-15 07:11:03,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 07:11:03,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2022-04-15 07:11:03,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 98 transitions. [2022-04-15 07:11:03,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:03,781 INFO L225 Difference]: With dead ends: 91 [2022-04-15 07:11:03,782 INFO L226 Difference]: Without dead ends: 82 [2022-04-15 07:11:03,782 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=300, Invalid=3860, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:11:03,783 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:03,783 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 07:11:03,783 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-15 07:11:03,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-04-15 07:11:03,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:03,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 07:11:03,802 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 07:11:03,802 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 07:11:03,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:03,804 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 07:11:03,804 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-15 07:11:03,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:03,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:03,804 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 82 states. [2022-04-15 07:11:03,804 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 82 states. [2022-04-15 07:11:03,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:03,805 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-15 07:11:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-15 07:11:03,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:03,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:03,805 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:03,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:03,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 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 07:11:03,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-15 07:11:03,807 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2022-04-15 07:11:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:03,807 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-15 07:11:03,807 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 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 07:11:03,807 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-15 07:11:03,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:03,921 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-15 07:11:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 07:11:03,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:03,921 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:03,921 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 07:11:03,922 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:03,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:03,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1925663067, now seen corresponding path program 28 times [2022-04-15 07:11:03,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:03,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1690412637] [2022-04-15 07:11:08,108 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:08,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:08,245 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,330 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:12,379 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,469 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,494 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:11:12,494 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:12,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,667 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:12,667 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:12,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1695783951, now seen corresponding path program 1 times [2022-04-15 07:11:12,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:12,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170282784] [2022-04-15 07:11:12,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:12,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:12,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:12,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:12,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:12,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11262#true} is VALID [2022-04-15 07:11:12,697 INFO L290 TraceCheckUtils]: 1: Hoare triple {11262#true} assume true; {11262#true} is VALID [2022-04-15 07:11:12,697 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11262#true} {11262#true} #56#return; {11262#true} is VALID [2022-04-15 07:11:12,698 INFO L272 TraceCheckUtils]: 0: Hoare triple {11262#true} call ULTIMATE.init(); {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:12,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11262#true} is VALID [2022-04-15 07:11:12,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {11262#true} assume true; {11262#true} is VALID [2022-04-15 07:11:12,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11262#true} {11262#true} #56#return; {11262#true} is VALID [2022-04-15 07:11:12,698 INFO L272 TraceCheckUtils]: 4: Hoare triple {11262#true} call #t~ret7 := main(); {11262#true} is VALID [2022-04-15 07:11:12,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {11262#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {11267#(= main_~a~0 0)} is VALID [2022-04-15 07:11:12,699 INFO L290 TraceCheckUtils]: 6: Hoare triple {11267#(= main_~a~0 0)} [118] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_2065 v_main_~c~0_2036) (= v_main_~a~0_184 v_main_~a~0_183) (= |v_main_#t~pre6_1168| |v_main_#t~pre6_1144|) (= |v_main_#t~pre5_669| |v_main_#t~pre5_664|) (= v_main_~b~0_864 v_main_~b~0_858) (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) InVars {main_~c~0=v_main_~c~0_2065, main_~b~0=v_main_~b~0_864, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_669|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_1168|} OutVars{main_~c~0=v_main_~c~0_2036, main_~b~0=v_main_~b~0_858, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_664|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_1144|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11267#(= main_~a~0 0)} is VALID [2022-04-15 07:11:12,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {11267#(= main_~a~0 0)} [117] L21-4_primed-->L21-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[] {11263#false} is VALID [2022-04-15 07:11:12,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {11263#false} is VALID [2022-04-15 07:11:12,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {11263#false} assume !false; {11263#false} is VALID [2022-04-15 07:11:12,699 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 07:11:12,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:12,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170282784] [2022-04-15 07:11:12,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170282784] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:12,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:12,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:13,487 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:13,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1690412637] [2022-04-15 07:11:13,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1690412637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:13,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:13,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 07:11:13,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306968228] [2022-04-15 07:11:13,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:13,488 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 75 [2022-04-15 07:11:13,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:13,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:11:13,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:13,537 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 07:11:13,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:13,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 07:11:13,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:11:13,539 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:11:16,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:16,094 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-04-15 07:11:16,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 07:11:16,094 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 75 [2022-04-15 07:11:16,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:16,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:11:16,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2022-04-15 07:11:16,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:11:16,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2022-04-15 07:11:16,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 100 transitions. [2022-04-15 07:11:16,164 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 07:11:16,164 INFO L225 Difference]: With dead ends: 93 [2022-04-15 07:11:16,164 INFO L226 Difference]: Without dead ends: 84 [2022-04-15 07:11:16,165 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 25 SyntacticMatches, 18 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=309, Invalid=4113, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:11:16,165 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:16,165 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 37 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:11:16,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-15 07:11:16,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-04-15 07:11:16,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:16,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 07:11:16,185 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 07:11:16,185 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 07:11:16,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:16,186 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 07:11:16,186 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 07:11:16,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:16,186 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:16,186 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 84 states. [2022-04-15 07:11:16,186 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 84 states. [2022-04-15 07:11:16,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:16,187 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-15 07:11:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 07:11:16,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:16,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:16,188 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:16,188 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:16,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 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 07:11:16,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-04-15 07:11:16,188 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2022-04-15 07:11:16,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:16,189 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-04-15 07:11:16,189 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 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 07:11:16,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 80 transitions. [2022-04-15 07:11:16,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:16,300 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-15 07:11:16,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 07:11:16,300 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:16,301 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:16,301 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 07:11:16,301 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:16,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:16,301 INFO L85 PathProgramCache]: Analyzing trace with hash 132809977, now seen corresponding path program 29 times [2022-04-15 07:11:16,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:16,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [403503730] [2022-04-15 07:11:20,479 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:20,519 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:20,608 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,685 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:24,726 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,808 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,857 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:24,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:11:24,864 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:25,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:25,003 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:25,013 INFO L85 PathProgramCache]: Analyzing trace with hash 1695845455, now seen corresponding path program 1 times [2022-04-15 07:11:25,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:25,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216779477] [2022-04-15 07:11:25,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:25,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:25,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:25,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:25,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:25,034 INFO L290 TraceCheckUtils]: 0: Hoare triple {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11876#true} is VALID [2022-04-15 07:11:25,034 INFO L290 TraceCheckUtils]: 1: Hoare triple {11876#true} assume true; {11876#true} is VALID [2022-04-15 07:11:25,034 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11876#true} {11876#true} #56#return; {11876#true} is VALID [2022-04-15 07:11:25,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {11876#true} call ULTIMATE.init(); {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:25,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11876#true} is VALID [2022-04-15 07:11:25,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {11876#true} assume true; {11876#true} is VALID [2022-04-15 07:11:25,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11876#true} {11876#true} #56#return; {11876#true} is VALID [2022-04-15 07:11:25,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {11876#true} call #t~ret7 := main(); {11876#true} is VALID [2022-04-15 07:11:25,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {11876#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {11881#(= main_~a~0 0)} is VALID [2022-04-15 07:11:25,036 INFO L290 TraceCheckUtils]: 6: Hoare triple {11881#(= main_~a~0 0)} [120] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_1223| |v_main_#t~pre6_1198|)) (.cse1 (= v_main_~b~0_903 v_main_~b~0_897)) (.cse2 (= |v_main_#t~pre5_698| |v_main_#t~pre5_693|)) (.cse3 (= v_main_~c~0_2171 v_main_~c~0_2141)) (.cse4 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_190 v_main_~a~0_189) .cse4) (and .cse0 .cse1 (= v_main_~a~0_189 v_main_~a~0_190) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_2171, main_~b~0=v_main_~b~0_903, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_698|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_1223|} OutVars{main_~c~0=v_main_~c~0_2141, main_~b~0=v_main_~b~0_897, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_693|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_1198|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11881#(= main_~a~0 0)} is VALID [2022-04-15 07:11:25,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {11881#(= main_~a~0 0)} [119] L21-4_primed-->L21-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[] {11877#false} is VALID [2022-04-15 07:11:25,037 INFO L290 TraceCheckUtils]: 8: Hoare triple {11877#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {11877#false} is VALID [2022-04-15 07:11:25,037 INFO L290 TraceCheckUtils]: 9: Hoare triple {11877#false} assume !false; {11877#false} is VALID [2022-04-15 07:11:25,037 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 07:11:25,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:25,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216779477] [2022-04-15 07:11:25,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216779477] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:25,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:25,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:25,802 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:25,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [403503730] [2022-04-15 07:11:25,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [403503730] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:25,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:25,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 07:11:25,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44614912] [2022-04-15 07:11:25,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:25,803 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 77 [2022-04-15 07:11:25,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:25,804 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 07:11:25,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:25,852 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 07:11:25,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:25,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 07:11:25,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 07:11:25,852 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 07:11:28,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:28,886 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-04-15 07:11:28,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 07:11:28,886 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 77 [2022-04-15 07:11:28,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 07:11:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-15 07:11:28,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 07:11:28,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-15 07:11:28,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 102 transitions. [2022-04-15 07:11:28,960 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:28,975 INFO L225 Difference]: With dead ends: 95 [2022-04-15 07:11:28,975 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 07:11:28,976 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 17 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=318, Invalid=4374, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 07:11:28,976 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 96 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:28,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 107 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 07:11:28,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 07:11:29,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-04-15 07:11:29,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:29,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 07:11:29,000 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 07:11:29,000 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 07:11:29,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:29,001 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 07:11:29,001 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 07:11:29,001 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:29,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:29,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 86 states. [2022-04-15 07:11:29,002 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 86 states. [2022-04-15 07:11:29,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:29,002 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-15 07:11:29,002 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 07:11:29,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:29,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:29,003 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:29,003 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:29,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 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 07:11:29,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-04-15 07:11:29,004 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2022-04-15 07:11:29,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:29,004 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-04-15 07:11:29,004 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 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 07:11:29,004 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 82 transitions. [2022-04-15 07:11:29,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:29,127 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-15 07:11:29,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 07:11:29,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:29,127 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:29,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 07:11:29,127 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:29,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:29,127 INFO L85 PathProgramCache]: Analyzing trace with hash -517123817, now seen corresponding path program 30 times [2022-04-15 07:11:29,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:29,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1758222778] [2022-04-15 07:11:32,192 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:32,231 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:32,311 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:36,387 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:36,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:36,512 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:36,554 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:39,251 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:39,302 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:39,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:39,461 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:39,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1695906959, now seen corresponding path program 1 times [2022-04-15 07:11:39,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:39,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541736222] [2022-04-15 07:11:39,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:39,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:39,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12505#true} is VALID [2022-04-15 07:11:39,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {12505#true} assume true; {12505#true} is VALID [2022-04-15 07:11:39,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12505#true} {12505#true} #56#return; {12505#true} is VALID [2022-04-15 07:11:39,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {12505#true} call ULTIMATE.init(); {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:39,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12505#true} is VALID [2022-04-15 07:11:39,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {12505#true} assume true; {12505#true} is VALID [2022-04-15 07:11:39,486 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12505#true} {12505#true} #56#return; {12505#true} is VALID [2022-04-15 07:11:39,486 INFO L272 TraceCheckUtils]: 4: Hoare triple {12505#true} call #t~ret7 := main(); {12505#true} is VALID [2022-04-15 07:11:39,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {12505#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12510#(= main_~a~0 0)} is VALID [2022-04-15 07:11:39,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {12510#(= main_~a~0 0)} [122] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_731| |v_main_#t~pre5_726|) (= v_main_~b~0_945 v_main_~b~0_939) (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|) (= v_main_~c~0_2284 v_main_~c~0_2253) (= v_main_~a~0_196 v_main_~a~0_195) (= |v_main_#t~pre6_1284| |v_main_#t~pre6_1258|)) InVars {main_~c~0=v_main_~c~0_2284, main_~b~0=v_main_~b~0_945, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_731|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_1284|} OutVars{main_~c~0=v_main_~c~0_2253, main_~b~0=v_main_~b~0_939, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_726|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_1258|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12510#(= main_~a~0 0)} is VALID [2022-04-15 07:11:39,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {12510#(= main_~a~0 0)} [121] L21-4_primed-->L21-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[] {12506#false} is VALID [2022-04-15 07:11:39,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {12506#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12506#false} is VALID [2022-04-15 07:11:39,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {12506#false} assume !false; {12506#false} is VALID [2022-04-15 07:11:39,488 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 07:11:39,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:39,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541736222] [2022-04-15 07:11:39,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541736222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:39,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:39,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:40,191 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:40,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1758222778] [2022-04-15 07:11:40,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1758222778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:40,192 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:40,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 07:11:40,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309175780] [2022-04-15 07:11:40,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:40,192 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 79 [2022-04-15 07:11:40,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:40,192 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 07:11:40,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:40,243 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 07:11:40,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:40,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 07:11:40,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:11:40,243 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 07:11:43,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:43,563 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-04-15 07:11:43,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 07:11:43,564 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 79 [2022-04-15 07:11:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:43,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 07:11:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2022-04-15 07:11:43,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 07:11:43,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2022-04-15 07:11:43,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 104 transitions. [2022-04-15 07:11:43,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:43,644 INFO L225 Difference]: With dead ends: 97 [2022-04-15 07:11:43,644 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:11:43,645 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=327, Invalid=4643, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 07:11:43,645 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:43,645 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 122 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:11:43,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:11:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-04-15 07:11:43,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:43,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 07:11:43,671 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 07:11:43,671 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 07:11:43,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:43,672 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 07:11:43,672 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 07:11:43,672 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:43,672 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:43,672 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 88 states. [2022-04-15 07:11:43,672 INFO L87 Difference]: Start difference. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 88 states. [2022-04-15 07:11:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:43,673 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-15 07:11:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 07:11:43,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:43,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:43,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:43,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:43,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 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 07:11:43,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-04-15 07:11:43,674 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2022-04-15 07:11:43,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:43,675 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-04-15 07:11:43,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 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 07:11:43,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 84 transitions. [2022-04-15 07:11:43,799 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 07:11:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-15 07:11:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 07:11:43,800 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:43,800 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:43,800 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 07:11:43,800 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:43,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:43,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1961725365, now seen corresponding path program 31 times [2022-04-15 07:11:43,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:43,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [50366869] [2022-04-15 07:11:43,987 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,250 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,298 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,304 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:11:44,305 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:44,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:44,450 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:44,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1695968463, now seen corresponding path program 1 times [2022-04-15 07:11:44,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:44,450 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173129099] [2022-04-15 07:11:44,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:44,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:44,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:44,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13149#true} is VALID [2022-04-15 07:11:44,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-15 07:11:44,471 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13149#true} {13149#true} #56#return; {13149#true} is VALID [2022-04-15 07:11:44,472 INFO L272 TraceCheckUtils]: 0: Hoare triple {13149#true} call ULTIMATE.init(); {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:44,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13149#true} is VALID [2022-04-15 07:11:44,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-15 07:11:44,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13149#true} {13149#true} #56#return; {13149#true} is VALID [2022-04-15 07:11:44,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {13149#true} call #t~ret7 := main(); {13149#true} is VALID [2022-04-15 07:11:44,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {13149#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {13154#(= main_~a~0 0)} is VALID [2022-04-15 07:11:44,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {13154#(= main_~a~0 0)} [124] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= v_main_~b~0_984 v_main_~b~0_978)) (.cse2 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse3 (= |v_main_#t~pre6_1343| |v_main_#t~pre6_1316|)) (.cse4 (= v_main_~c~0_2396 v_main_~c~0_2364))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_755| |v_main_#t~pre5_760|) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_760| |v_main_#t~pre5_755|) .cse4))) InVars {main_~c~0=v_main_~c~0_2396, main_~b~0=v_main_~b~0_984, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_760|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_1343|} OutVars{main_~c~0=v_main_~c~0_2364, main_~b~0=v_main_~b~0_978, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_755|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_1316|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13154#(= main_~a~0 0)} is VALID [2022-04-15 07:11:44,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {13154#(= main_~a~0 0)} [123] L21-4_primed-->L21-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[] {13150#false} is VALID [2022-04-15 07:11:44,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {13150#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {13150#false} is VALID [2022-04-15 07:11:44,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-15 07:11:44,478 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 07:11:44,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:44,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173129099] [2022-04-15 07:11:44,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173129099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:44,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:44,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:45,342 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:45,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [50366869] [2022-04-15 07:11:45,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [50366869] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:45,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:45,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 07:11:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398428908] [2022-04-15 07:11:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:45,343 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 81 [2022-04-15 07:11:45,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:45,343 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 07:11:45,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:45,393 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 07:11:45,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:45,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 07:11:45,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 07:11:45,394 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 07:11:48,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:48,681 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-04-15 07:11:48,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 07:11:48,681 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 81 [2022-04-15 07:11:48,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:48,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 07:11:48,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2022-04-15 07:11:48,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 07:11:48,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2022-04-15 07:11:48,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 106 transitions. [2022-04-15 07:11:48,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:48,758 INFO L225 Difference]: With dead ends: 99 [2022-04-15 07:11:48,758 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 07:11:48,759 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 17 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=336, Invalid=4920, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:11:48,759 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 101 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:48,759 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:11:48,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 07:11:48,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-04-15 07:11:48,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:48,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 07:11:48,782 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 07:11:48,782 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 07:11:48,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:48,783 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-15 07:11:48,783 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-15 07:11:48,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:48,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:48,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 90 states. [2022-04-15 07:11:48,783 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 90 states. [2022-04-15 07:11:48,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:48,784 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-15 07:11:48,784 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-15 07:11:48,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:48,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:48,784 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:48,784 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:48,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 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 07:11:48,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-15 07:11:48,785 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2022-04-15 07:11:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:48,785 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-15 07:11:48,785 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 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 07:11:48,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-15 07:11:48,915 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 07:11:48,915 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-15 07:11:48,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 07:11:48,915 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:48,915 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:48,915 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 07:11:48,915 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:48,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:48,916 INFO L85 PathProgramCache]: Analyzing trace with hash 428939987, now seen corresponding path program 32 times [2022-04-15 07:11:48,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:48,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [482158414] [2022-04-15 07:11:53,083 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:53,131 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:53,214 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,293 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:57,340 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,423 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,470 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,752 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:57,752 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:57,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1696029967, now seen corresponding path program 1 times [2022-04-15 07:11:57,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:57,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189330568] [2022-04-15 07:11:57,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:57,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:57,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:57,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:57,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:57,772 INFO L290 TraceCheckUtils]: 0: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13808#true} {13808#true} #56#return; {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {13808#true} call ULTIMATE.init(); {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:57,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L290 TraceCheckUtils]: 2: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13808#true} {13808#true} #56#return; {13808#true} is VALID [2022-04-15 07:11:57,773 INFO L272 TraceCheckUtils]: 4: Hoare triple {13808#true} call #t~ret7 := main(); {13808#true} is VALID [2022-04-15 07:11:57,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {13808#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {13813#(= main_~a~0 0)} is VALID [2022-04-15 07:11:57,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {13813#(= main_~a~0 0)} [126] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2515 v_main_~c~0_2482)) (.cse1 (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|)) (.cse2 (= |v_main_#t~pre5_793| |v_main_#t~pre5_788|)) (.cse3 (= v_main_~b~0_1026 v_main_~b~0_1020)) (.cse4 (= v_main_~a~0_208 v_main_~a~0_207))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1380| |v_main_#t~pre6_1408|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1408| |v_main_#t~pre6_1380|)))) InVars {main_~c~0=v_main_~c~0_2515, main_~b~0=v_main_~b~0_1026, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_793|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_1408|} OutVars{main_~c~0=v_main_~c~0_2482, main_~b~0=v_main_~b~0_1020, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_788|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_1380|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13813#(= main_~a~0 0)} is VALID [2022-04-15 07:11:57,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {13813#(= main_~a~0 0)} [125] L21-4_primed-->L21-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[] {13809#false} is VALID [2022-04-15 07:11:57,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {13809#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {13809#false} is VALID [2022-04-15 07:11:57,775 INFO L290 TraceCheckUtils]: 9: Hoare triple {13809#false} assume !false; {13809#false} is VALID [2022-04-15 07:11:57,775 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 07:11:57,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:57,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189330568] [2022-04-15 07:11:57,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189330568] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:57,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:57,775 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:58,623 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:58,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [482158414] [2022-04-15 07:11:58,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [482158414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:58,624 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:58,624 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 07:11:58,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053953289] [2022-04-15 07:11:58,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:58,624 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 83 [2022-04-15 07:11:58,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:58,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 07:11:58,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:58,681 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 07:11:58,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:58,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 07:11:58,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:11:58,681 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 07:12:02,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:02,115 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-04-15 07:12:02,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 07:12:02,115 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 83 [2022-04-15 07:12:02,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:02,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 07:12:02,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2022-04-15 07:12:02,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 07:12:02,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2022-04-15 07:12:02,132 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 108 transitions. [2022-04-15 07:12:02,219 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 07:12:02,220 INFO L225 Difference]: With dead ends: 101 [2022-04-15 07:12:02,220 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:12:02,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=345, Invalid=5205, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 07:12:02,221 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:02,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 167 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:12:02,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:12:02,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2022-04-15 07:12:02,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:02,246 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 07:12:02,246 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 07:12:02,246 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 07:12:02,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:02,247 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 07:12:02,247 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 07:12:02,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:02,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:02,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 92 states. [2022-04-15 07:12:02,247 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 92 states. [2022-04-15 07:12:02,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:02,248 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-15 07:12:02,248 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 07:12:02,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:02,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:02,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:02,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 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 07:12:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-04-15 07:12:02,250 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2022-04-15 07:12:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:02,250 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-04-15 07:12:02,250 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 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 07:12:02,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 88 transitions. [2022-04-15 07:12:02,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:02,393 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-04-15 07:12:02,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 07:12:02,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:02,393 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:02,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 07:12:02,393 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:02,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:02,394 INFO L85 PathProgramCache]: Analyzing trace with hash 595974257, now seen corresponding path program 33 times [2022-04-15 07:12:02,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:02,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1780809650] [2022-04-15 07:12:02,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,690 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:02,943 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:02,943 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:03,097 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:03,097 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:03,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1696091471, now seen corresponding path program 1 times [2022-04-15 07:12:03,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:03,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119595673] [2022-04-15 07:12:03,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:03,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:03,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:03,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:03,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:03,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14482#true} is VALID [2022-04-15 07:12:03,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 07:12:03,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14482#true} {14482#true} #56#return; {14482#true} is VALID [2022-04-15 07:12:03,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {14482#true} call ULTIMATE.init(); {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:03,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14482#true} is VALID [2022-04-15 07:12:03,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-15 07:12:03,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14482#true} {14482#true} #56#return; {14482#true} is VALID [2022-04-15 07:12:03,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {14482#true} call #t~ret7 := main(); {14482#true} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {14482#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {14487#(= main_~a~0 0)} is VALID [2022-04-15 07:12:03,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {14487#(= main_~a~0 0)} [128] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_1065 v_main_~b~0_1059)) (.cse1 (= |v_main_#t~pre6_1471| |v_main_#t~pre6_1442|)) (.cse2 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse3 (= v_main_~c~0_2633 v_main_~c~0_2599))) (or (and .cse0 (= |v_main_#t~pre5_817| |v_main_#t~pre5_822|) .cse1 (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse2 .cse3) (and .cse0 (= |v_main_#t~pre5_822| |v_main_#t~pre5_817|) .cse1 .cse2 .cse3 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|)))) InVars {main_~c~0=v_main_~c~0_2633, main_~b~0=v_main_~b~0_1065, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_822|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_1471|} OutVars{main_~c~0=v_main_~c~0_2599, main_~b~0=v_main_~b~0_1059, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_817|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_1442|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14487#(= main_~a~0 0)} is VALID [2022-04-15 07:12:03,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {14487#(= main_~a~0 0)} [127] L21-4_primed-->L21-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[] {14483#false} is VALID [2022-04-15 07:12:03,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {14483#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {14483#false} is VALID [2022-04-15 07:12:03,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {14483#false} assume !false; {14483#false} is VALID [2022-04-15 07:12:03,125 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 07:12:03,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:03,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119595673] [2022-04-15 07:12:03,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119595673] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:03,125 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:03,125 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:04,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:04,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1780809650] [2022-04-15 07:12:04,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1780809650] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:04,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:04,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 07:12:04,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048036388] [2022-04-15 07:12:04,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:04,059 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 85 [2022-04-15 07:12:04,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:04,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 07:12:04,112 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 07:12:04,112 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 07:12:04,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:04,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 07:12:04,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 07:12:04,113 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 07:12:07,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:07,631 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-04-15 07:12:07,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 07:12:07,631 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 85 [2022-04-15 07:12:07,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:07,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 07:12:07,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 113 transitions. [2022-04-15 07:12:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 07:12:07,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 113 transitions. [2022-04-15 07:12:07,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 113 transitions. [2022-04-15 07:12:07,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:07,716 INFO L225 Difference]: With dead ends: 105 [2022-04-15 07:12:07,716 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 07:12:07,716 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 28 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=354, Invalid=5498, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 07:12:07,717 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:07,717 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 157 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 07:12:07,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 07:12:07,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-04-15 07:12:07,742 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:07,742 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 07:12:07,742 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 07:12:07,743 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 07:12:07,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:07,743 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 07:12:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 07:12:07,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:07,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:07,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 96 states. [2022-04-15 07:12:07,744 INFO L87 Difference]: Start difference. First operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 96 states. [2022-04-15 07:12:07,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:07,745 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-15 07:12:07,745 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 07:12:07,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:07,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:07,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:07,745 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 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 07:12:07,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2022-04-15 07:12:07,746 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 85 [2022-04-15 07:12:07,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:07,746 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2022-04-15 07:12:07,746 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 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 07:12:07,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 92 transitions. [2022-04-15 07:12:07,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:07,889 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2022-04-15 07:12:07,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 07:12:07,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:07,889 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:07,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 07:12:07,889 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:07,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:07,890 INFO L85 PathProgramCache]: Analyzing trace with hash -2092849521, now seen corresponding path program 34 times [2022-04-15 07:12:07,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:07,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1519193040] [2022-04-15 07:12:10,594 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:10,642 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:10,723 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:14,800 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:14,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:14,933 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:14,957 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:14,957 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:15,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:15,131 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:15,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1696152975, now seen corresponding path program 1 times [2022-04-15 07:12:15,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:15,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1141614196] [2022-04-15 07:12:15,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:15,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:15,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:15,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15183#true} is VALID [2022-04-15 07:12:15,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {15183#true} assume true; {15183#true} is VALID [2022-04-15 07:12:15,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15183#true} {15183#true} #56#return; {15183#true} is VALID [2022-04-15 07:12:15,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {15183#true} call ULTIMATE.init(); {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:15,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15183#true} is VALID [2022-04-15 07:12:15,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {15183#true} assume true; {15183#true} is VALID [2022-04-15 07:12:15,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15183#true} {15183#true} #56#return; {15183#true} is VALID [2022-04-15 07:12:15,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {15183#true} call #t~ret7 := main(); {15183#true} is VALID [2022-04-15 07:12:15,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {15183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {15188#(= main_~a~0 0)} is VALID [2022-04-15 07:12:15,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {15188#(= main_~a~0 0)} [130] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_2742 v_main_~c~0_2707) (= |v_main_#t~pre5_845| |v_main_#t~pre5_840|) (= |v_main_#t~pre6_1525| |v_main_#t~pre6_1495|) (= v_main_~b~0_1097 v_main_~b~0_1091) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= v_main_~a~0_220 v_main_~a~0_219)) InVars {main_~c~0=v_main_~c~0_2742, main_~b~0=v_main_~b~0_1097, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_845|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_1525|} OutVars{main_~c~0=v_main_~c~0_2707, main_~b~0=v_main_~b~0_1091, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_840|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_1495|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15188#(= main_~a~0 0)} is VALID [2022-04-15 07:12:15,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {15188#(= main_~a~0 0)} [129] L21-4_primed-->L21-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[] {15184#false} is VALID [2022-04-15 07:12:15,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {15184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {15184#false} is VALID [2022-04-15 07:12:15,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {15184#false} assume !false; {15184#false} is VALID [2022-04-15 07:12:15,154 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 07:12:15,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:15,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1141614196] [2022-04-15 07:12:15,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1141614196] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:15,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:15,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:16,159 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:16,159 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1519193040] [2022-04-15 07:12:16,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1519193040] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:16,159 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:16,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 07:12:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533458398] [2022-04-15 07:12:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:16,160 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 87 [2022-04-15 07:12:16,160 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:16,160 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 07:12:16,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:16,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 07:12:16,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:16,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 07:12:16,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:12:16,216 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 07:12:19,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:19,865 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-04-15 07:12:19,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 07:12:19,865 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 87 [2022-04-15 07:12:19,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:19,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 07:12:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 113 transitions. [2022-04-15 07:12:19,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 07:12:19,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 113 transitions. [2022-04-15 07:12:19,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 113 transitions. [2022-04-15 07:12:19,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:19,945 INFO L225 Difference]: With dead ends: 106 [2022-04-15 07:12:19,945 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 07:12:19,946 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 17 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=363, Invalid=5799, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 07:12:19,946 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:19,947 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 97 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 07:12:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 07:12:19,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-15 07:12:19,978 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:19,978 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 07:12:19,978 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 07:12:19,978 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 07:12:19,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:19,979 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 07:12:19,979 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-15 07:12:19,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:19,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:19,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 97 states. [2022-04-15 07:12:19,979 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 97 states. [2022-04-15 07:12:19,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:19,980 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-15 07:12:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-15 07:12:19,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:19,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:19,980 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:19,980 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:19,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 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 07:12:19,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-15 07:12:19,981 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-15 07:12:19,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:19,981 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-15 07:12:19,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 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 07:12:19,982 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-15 07:12:20,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-15 07:12:20,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 07:12:20,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:20,134 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:20,134 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 07:12:20,134 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:20,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:20,134 INFO L85 PathProgramCache]: Analyzing trace with hash -246406746, now seen corresponding path program 35 times [2022-04-15 07:12:20,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:20,134 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [74928856] [2022-04-15 07:12:20,324 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,413 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,526 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,632 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:20,632 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:20,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,814 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:20,814 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:20,815 INFO L85 PathProgramCache]: Analyzing trace with hash 1696214479, now seen corresponding path program 1 times [2022-04-15 07:12:20,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:20,815 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506414125] [2022-04-15 07:12:20,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:20,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:20,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:20,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:20,836 INFO L290 TraceCheckUtils]: 0: Hoare triple {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15895#true} is VALID [2022-04-15 07:12:20,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {15895#true} assume true; {15895#true} is VALID [2022-04-15 07:12:20,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15895#true} {15895#true} #56#return; {15895#true} is VALID [2022-04-15 07:12:20,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {15895#true} call ULTIMATE.init(); {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:20,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15895#true} is VALID [2022-04-15 07:12:20,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {15895#true} assume true; {15895#true} is VALID [2022-04-15 07:12:20,837 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15895#true} {15895#true} #56#return; {15895#true} is VALID [2022-04-15 07:12:20,837 INFO L272 TraceCheckUtils]: 4: Hoare triple {15895#true} call #t~ret7 := main(); {15895#true} is VALID [2022-04-15 07:12:20,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {15895#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {15900#(= main_~a~0 0)} is VALID [2022-04-15 07:12:20,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {15900#(= main_~a~0 0)} [132] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= |v_main_#t~pre6_1579| |v_main_#t~pre6_1549|)) (.cse2 (= |v_main_#t~pre5_875| |v_main_#t~pre5_869|)) (.cse3 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse4 (= v_main_~c~0_2859 v_main_~c~0_2823))) (or (and .cse0 (= v_main_~b~0_1131 v_main_~b~0_1138) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= v_main_~b~0_1138 v_main_~b~0_1131) .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_2859, main_~b~0=v_main_~b~0_1138, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_875|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_1579|} OutVars{main_~c~0=v_main_~c~0_2823, main_~b~0=v_main_~b~0_1131, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_869|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_1549|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15900#(= main_~a~0 0)} is VALID [2022-04-15 07:12:20,838 INFO L290 TraceCheckUtils]: 7: Hoare triple {15900#(= main_~a~0 0)} [131] L21-4_primed-->L21-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[] {15896#false} is VALID [2022-04-15 07:12:20,838 INFO L290 TraceCheckUtils]: 8: Hoare triple {15896#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {15896#false} is VALID [2022-04-15 07:12:20,839 INFO L290 TraceCheckUtils]: 9: Hoare triple {15896#false} assume !false; {15896#false} is VALID [2022-04-15 07:12:20,839 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 07:12:20,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:20,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506414125] [2022-04-15 07:12:20,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506414125] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:20,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:20,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:21,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:21,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [74928856] [2022-04-15 07:12:21,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [74928856] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:21,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:21,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 07:12:21,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509623453] [2022-04-15 07:12:21,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:21,829 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-15 07:12:21,829 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:21,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:12:21,886 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:21,886 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 07:12:21,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:21,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 07:12:21,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 07:12:21,887 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:12:26,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:26,323 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-15 07:12:26,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 07:12:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 90 [2022-04-15 07:12:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:26,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:12:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-04-15 07:12:26,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:12:26,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-04-15 07:12:26,325 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 115 transitions. [2022-04-15 07:12:26,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:26,402 INFO L225 Difference]: With dead ends: 108 [2022-04-15 07:12:26,402 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 07:12:26,403 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=372, Invalid=6108, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 07:12:26,404 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 108 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:26,404 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 142 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 07:12:26,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 07:12:26,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2022-04-15 07:12:26,431 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:26,431 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 07:12:26,431 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 07:12:26,431 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 07:12:26,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:26,432 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-15 07:12:26,432 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-15 07:12:26,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:26,432 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:26,432 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 99 states. [2022-04-15 07:12:26,432 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 99 states. [2022-04-15 07:12:26,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:26,433 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-15 07:12:26,433 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-15 07:12:26,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:26,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:26,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:26,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:26,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 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 07:12:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-15 07:12:26,434 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2022-04-15 07:12:26,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:26,435 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-15 07:12:26,435 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 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 07:12:26,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 95 transitions. [2022-04-15 07:12:26,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-15 07:12:26,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 07:12:26,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:26,583 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:26,583 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 07:12:26,583 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:26,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:26,583 INFO L85 PathProgramCache]: Analyzing trace with hash 127825540, now seen corresponding path program 36 times [2022-04-15 07:12:26,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:26,583 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1355159315] [2022-04-15 07:12:26,766 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:26,849 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:26,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:27,025 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:27,068 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:29,106 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:29,167 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:29,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:29,351 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:29,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1696275983, now seen corresponding path program 1 times [2022-04-15 07:12:29,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:29,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021474945] [2022-04-15 07:12:29,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:29,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:29,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:29,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16620#true} is VALID [2022-04-15 07:12:29,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {16620#true} assume true; {16620#true} is VALID [2022-04-15 07:12:29,373 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16620#true} {16620#true} #56#return; {16620#true} is VALID [2022-04-15 07:12:29,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {16620#true} call ULTIMATE.init(); {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:29,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16620#true} is VALID [2022-04-15 07:12:29,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {16620#true} assume true; {16620#true} is VALID [2022-04-15 07:12:29,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16620#true} {16620#true} #56#return; {16620#true} is VALID [2022-04-15 07:12:29,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {16620#true} call #t~ret7 := main(); {16620#true} is VALID [2022-04-15 07:12:29,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {16620#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {16625#(= main_~a~0 0)} is VALID [2022-04-15 07:12:29,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {16625#(= main_~a~0 0)} [134] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_1182 v_main_~b~0_1175) (= |v_main_#t~pre5_909| |v_main_#t~pre5_903|) (= v_main_~c~0_2983 v_main_~c~0_2946) (= v_main_~a~0_232 v_main_~a~0_231) (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|) (= |v_main_#t~pre6_1644| |v_main_#t~pre6_1613|)) InVars {main_~c~0=v_main_~c~0_2983, main_~b~0=v_main_~b~0_1182, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_909|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_1644|} OutVars{main_~c~0=v_main_~c~0_2946, main_~b~0=v_main_~b~0_1175, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_903|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_1613|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16625#(= main_~a~0 0)} is VALID [2022-04-15 07:12:29,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {16625#(= main_~a~0 0)} [133] L21-4_primed-->L21-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[] {16621#false} is VALID [2022-04-15 07:12:29,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {16621#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {16621#false} is VALID [2022-04-15 07:12:29,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {16621#false} assume !false; {16621#false} is VALID [2022-04-15 07:12:29,379 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 07:12:29,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:29,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021474945] [2022-04-15 07:12:29,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021474945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:29,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:29,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:30,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:30,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1355159315] [2022-04-15 07:12:30,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1355159315] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:30,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:30,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 07:12:30,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1496322284] [2022-04-15 07:12:30,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:30,451 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 92 [2022-04-15 07:12:30,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:30,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 07:12:30,566 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:30,567 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 07:12:30,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:30,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 07:12:30,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:12:30,567 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 07:12:34,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:34,806 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-04-15 07:12:34,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 07:12:34,806 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 92 [2022-04-15 07:12:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:34,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 07:12:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 117 transitions. [2022-04-15 07:12:34,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 07:12:34,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 117 transitions. [2022-04-15 07:12:34,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 117 transitions. [2022-04-15 07:12:34,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:34,890 INFO L225 Difference]: With dead ends: 110 [2022-04-15 07:12:34,890 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 07:12:34,890 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 30 SyntacticMatches, 22 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=381, Invalid=6425, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:12:34,891 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 102 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:34,891 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 07:12:34,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 07:12:34,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-04-15 07:12:34,924 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:34,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 07:12:34,924 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 07:12:34,925 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 07:12:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:34,925 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 07:12:34,926 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 07:12:34,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:34,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:34,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 101 states. [2022-04-15 07:12:34,926 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 101 states. [2022-04-15 07:12:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:34,927 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-15 07:12:34,927 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-15 07:12:34,927 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:34,927 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:34,927 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:34,927 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:34,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 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 07:12:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-15 07:12:34,928 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2022-04-15 07:12:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:34,928 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-15 07:12:34,928 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 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 07:12:34,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 97 transitions. [2022-04-15 07:12:35,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:35,086 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-15 07:12:35,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 07:12:35,086 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:35,086 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:35,087 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 07:12:35,087 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:35,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:35,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1012200478, now seen corresponding path program 37 times [2022-04-15 07:12:35,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:35,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2084547861] [2022-04-15 07:12:39,265 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:39,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:39,389 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:41,626 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:41,666 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:41,750 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:41,793 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:41,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:41,800 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:41,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:41,974 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1696337487, now seen corresponding path program 1 times [2022-04-15 07:12:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272846599] [2022-04-15 07:12:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:41,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:41,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:41,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17360#true} is VALID [2022-04-15 07:12:41,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {17360#true} assume true; {17360#true} is VALID [2022-04-15 07:12:41,995 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17360#true} {17360#true} #56#return; {17360#true} is VALID [2022-04-15 07:12:41,995 INFO L272 TraceCheckUtils]: 0: Hoare triple {17360#true} call ULTIMATE.init(); {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:41,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17360#true} is VALID [2022-04-15 07:12:41,996 INFO L290 TraceCheckUtils]: 2: Hoare triple {17360#true} assume true; {17360#true} is VALID [2022-04-15 07:12:41,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17360#true} {17360#true} #56#return; {17360#true} is VALID [2022-04-15 07:12:41,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {17360#true} call #t~ret7 := main(); {17360#true} is VALID [2022-04-15 07:12:41,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {17360#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {17365#(= main_~a~0 0)} is VALID [2022-04-15 07:12:41,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {17365#(= main_~a~0 0)} [136] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_238 v_main_~a~0_237)) (.cse1 (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|)) (.cse2 (= v_main_~b~0_1223 v_main_~b~0_1216)) (.cse3 (= |v_main_#t~pre6_1707| |v_main_#t~pre6_1675|)) (.cse4 (= v_main_~c~0_3106 v_main_~c~0_3068))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_939| |v_main_#t~pre5_933|)) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_933| |v_main_#t~pre5_939|) .cse4))) InVars {main_~c~0=v_main_~c~0_3106, main_~b~0=v_main_~b~0_1223, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_939|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_1707|} OutVars{main_~c~0=v_main_~c~0_3068, main_~b~0=v_main_~b~0_1216, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_933|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_1675|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17365#(= main_~a~0 0)} is VALID [2022-04-15 07:12:41,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {17365#(= main_~a~0 0)} [135] L21-4_primed-->L21-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[] {17361#false} is VALID [2022-04-15 07:12:41,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {17361#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {17361#false} is VALID [2022-04-15 07:12:41,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#false} assume !false; {17361#false} is VALID [2022-04-15 07:12:41,997 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 07:12:41,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:41,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272846599] [2022-04-15 07:12:41,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272846599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:41,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:41,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:43,141 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:43,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2084547861] [2022-04-15 07:12:43,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2084547861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:43,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:43,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 07:12:43,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558580139] [2022-04-15 07:12:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 94 [2022-04-15 07:12:43,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:43,142 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 07:12:43,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:43,200 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 07:12:43,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:43,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 07:12:43,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 07:12:43,200 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 07:12:47,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:47,776 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-04-15 07:12:47,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 07:12:47,776 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 94 [2022-04-15 07:12:47,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:47,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 07:12:47,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 119 transitions. [2022-04-15 07:12:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 07:12:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 119 transitions. [2022-04-15 07:12:47,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 119 transitions. [2022-04-15 07:12:47,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:47,858 INFO L225 Difference]: With dead ends: 112 [2022-04-15 07:12:47,858 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 07:12:47,859 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 28 SyntacticMatches, 25 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=390, Invalid=6750, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 07:12:47,859 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:47,859 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 167 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 07:12:47,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 07:12:47,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-04-15 07:12:47,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:47,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 07:12:47,889 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 07:12:47,889 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 07:12:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:47,890 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 07:12:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-15 07:12:47,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:47,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:47,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 103 states. [2022-04-15 07:12:47,891 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 103 states. [2022-04-15 07:12:47,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:47,891 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-15 07:12:47,891 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-15 07:12:47,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:47,892 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:47,892 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:47,892 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 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 07:12:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-04-15 07:12:47,893 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2022-04-15 07:12:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:47,893 INFO L478 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-04-15 07:12:47,893 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 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 07:12:47,893 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 99 transitions. [2022-04-15 07:12:48,057 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 07:12:48,058 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-15 07:12:48,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 07:12:48,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:48,058 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:48,058 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 07:12:48,058 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:48,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:48,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1360543296, now seen corresponding path program 38 times [2022-04-15 07:12:48,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:48,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537514449] [2022-04-15 07:12:50,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:50,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:53,073 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:53,157 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:53,200 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:53,206 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:12:53,206 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:53,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:53,361 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:53,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1696398991, now seen corresponding path program 1 times [2022-04-15 07:12:53,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:53,362 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075176718] [2022-04-15 07:12:53,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:53,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:53,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:53,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:53,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18115#true} is VALID [2022-04-15 07:12:53,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {18115#true} assume true; {18115#true} is VALID [2022-04-15 07:12:53,391 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18115#true} {18115#true} #56#return; {18115#true} is VALID [2022-04-15 07:12:53,391 INFO L272 TraceCheckUtils]: 0: Hoare triple {18115#true} call ULTIMATE.init(); {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:53,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18115#true} is VALID [2022-04-15 07:12:53,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {18115#true} assume true; {18115#true} is VALID [2022-04-15 07:12:53,392 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18115#true} {18115#true} #56#return; {18115#true} is VALID [2022-04-15 07:12:53,392 INFO L272 TraceCheckUtils]: 4: Hoare triple {18115#true} call #t~ret7 := main(); {18115#true} is VALID [2022-04-15 07:12:53,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {18115#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {18120#(= main_~a~0 0)} is VALID [2022-04-15 07:12:53,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {18120#(= main_~a~0 0)} [138] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_1264 v_main_~b~0_1257) (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|) (= |v_main_#t~pre5_969| |v_main_#t~pre5_963|) (= v_main_~a~0_244 v_main_~a~0_243) (= |v_main_#t~pre6_1772| |v_main_#t~pre6_1739|) (= v_main_~c~0_3232 v_main_~c~0_3193)) InVars {main_~c~0=v_main_~c~0_3232, main_~b~0=v_main_~b~0_1264, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_969|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_1772|} OutVars{main_~c~0=v_main_~c~0_3193, main_~b~0=v_main_~b~0_1257, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_963|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_1739|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18120#(= main_~a~0 0)} is VALID [2022-04-15 07:12:53,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {18120#(= main_~a~0 0)} [137] L21-4_primed-->L21-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[] {18116#false} is VALID [2022-04-15 07:12:53,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {18116#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {18116#false} is VALID [2022-04-15 07:12:53,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {18116#false} assume !false; {18116#false} is VALID [2022-04-15 07:12:53,393 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 07:12:53,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:53,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075176718] [2022-04-15 07:12:53,393 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075176718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:53,393 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:53,393 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:54,670 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:54,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537514449] [2022-04-15 07:12:54,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537514449] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:54,670 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:54,670 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 07:12:54,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947430836] [2022-04-15 07:12:54,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:54,671 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 96 [2022-04-15 07:12:54,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:54,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 07:12:54,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:54,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 07:12:54,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:54,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 07:12:54,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:12:54,731 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 07:12:59,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:59,615 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-04-15 07:12:59,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 07:12:59,615 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 96 [2022-04-15 07:12:59,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 07:12:59,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 121 transitions. [2022-04-15 07:12:59,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 07:12:59,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 121 transitions. [2022-04-15 07:12:59,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 121 transitions. [2022-04-15 07:12:59,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:59,708 INFO L225 Difference]: With dead ends: 114 [2022-04-15 07:12:59,708 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 07:12:59,708 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 25 SyntacticMatches, 29 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=399, Invalid=7083, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 07:12:59,708 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:59,709 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 37 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-15 07:12:59,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 07:12:59,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2022-04-15 07:12:59,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:59,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 07:12:59,739 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 07:12:59,740 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 07:12:59,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:59,740 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 07:12:59,740 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 07:12:59,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:59,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:59,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 105 states. [2022-04-15 07:12:59,741 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 105 states. [2022-04-15 07:12:59,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:59,742 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-15 07:12:59,742 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-15 07:12:59,742 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:59,742 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:59,742 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:59,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 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 07:12:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-04-15 07:12:59,743 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2022-04-15 07:12:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:59,743 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-04-15 07:12:59,743 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 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 07:12:59,743 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 101 transitions. [2022-04-15 07:12:59,907 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 07:12:59,907 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-04-15 07:12:59,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 07:12:59,907 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:59,908 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:59,908 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 07:12:59,908 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:59,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:59,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1110542306, now seen corresponding path program 39 times [2022-04-15 07:12:59,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:59,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724309407] [2022-04-15 07:13:00,108 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,193 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,306 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,390 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,437 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,444 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:13:00,444 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:00,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:00,592 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:00,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1696460495, now seen corresponding path program 1 times [2022-04-15 07:13:00,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:00,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904246082] [2022-04-15 07:13:00,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:00,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:00,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:00,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18885#true} is VALID [2022-04-15 07:13:00,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {18885#true} assume true; {18885#true} is VALID [2022-04-15 07:13:00,616 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18885#true} {18885#true} #56#return; {18885#true} is VALID [2022-04-15 07:13:00,617 INFO L272 TraceCheckUtils]: 0: Hoare triple {18885#true} call ULTIMATE.init(); {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:00,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18885#true} is VALID [2022-04-15 07:13:00,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {18885#true} assume true; {18885#true} is VALID [2022-04-15 07:13:00,617 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18885#true} {18885#true} #56#return; {18885#true} is VALID [2022-04-15 07:13:00,617 INFO L272 TraceCheckUtils]: 4: Hoare triple {18885#true} call #t~ret7 := main(); {18885#true} is VALID [2022-04-15 07:13:00,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {18885#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {18890#(= main_~a~0 0)} is VALID [2022-04-15 07:13:00,618 INFO L290 TraceCheckUtils]: 6: Hoare triple {18890#(= main_~a~0 0)} [140] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_999| |v_main_#t~pre5_993|)) (.cse1 (= v_main_~c~0_3361 v_main_~c~0_3321)) (.cse2 (= |v_main_#t~pre6_1839| |v_main_#t~pre6_1805|)) (.cse3 (= v_main_~b~0_1305 v_main_~b~0_1298)) (.cse4 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_250 v_main_~a~0_249)) (and .cse0 .cse1 .cse2 (= v_main_~a~0_249 v_main_~a~0_250) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_3361, main_~b~0=v_main_~b~0_1305, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_999|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_1839|} OutVars{main_~c~0=v_main_~c~0_3321, main_~b~0=v_main_~b~0_1298, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_993|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_1805|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18890#(= main_~a~0 0)} is VALID [2022-04-15 07:13:00,618 INFO L290 TraceCheckUtils]: 7: Hoare triple {18890#(= main_~a~0 0)} [139] L21-4_primed-->L21-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[] {18886#false} is VALID [2022-04-15 07:13:00,618 INFO L290 TraceCheckUtils]: 8: Hoare triple {18886#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {18886#false} is VALID [2022-04-15 07:13:00,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {18886#false} assume !false; {18886#false} is VALID [2022-04-15 07:13:00,618 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 07:13:00,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:00,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904246082] [2022-04-15 07:13:00,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904246082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:00,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:00,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:01,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:01,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724309407] [2022-04-15 07:13:01,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724309407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:01,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:01,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 07:13:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353076307] [2022-04-15 07:13:01,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 98 [2022-04-15 07:13:01,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:01,760 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 07:13:01,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:01,821 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 07:13:01,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:01,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 07:13:01,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 07:13:01,821 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 07:13:06,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:06,669 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-15 07:13:06,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 07:13:06,669 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 98 [2022-04-15 07:13:06,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:06,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 07:13:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 123 transitions. [2022-04-15 07:13:06,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 07:13:06,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 123 transitions. [2022-04-15 07:13:06,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 123 transitions. [2022-04-15 07:13:06,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:06,756 INFO L225 Difference]: With dead ends: 116 [2022-04-15 07:13:06,756 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 07:13:06,756 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 36 SyntacticMatches, 19 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=408, Invalid=7424, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 07:13:06,756 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 108 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:06,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [108 Valid, 192 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 07:13:06,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 07:13:06,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-04-15 07:13:06,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:06,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 07:13:06,788 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 07:13:06,788 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 07:13:06,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:06,789 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-15 07:13:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-15 07:13:06,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:06,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:06,790 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 107 states. [2022-04-15 07:13:06,790 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 107 states. [2022-04-15 07:13:06,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:06,791 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-15 07:13:06,791 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-15 07:13:06,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:06,791 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:06,791 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:06,791 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:06,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 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 07:13:06,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-04-15 07:13:06,792 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2022-04-15 07:13:06,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:06,792 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-04-15 07:13:06,792 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 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 07:13:06,792 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 103 transitions. [2022-04-15 07:13:06,962 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:06,962 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-04-15 07:13:06,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-15 07:13:06,962 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:06,962 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:06,962 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 07:13:06,963 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:06,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:06,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1377759492, now seen corresponding path program 40 times [2022-04-15 07:13:06,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:06,963 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [709997670] [2022-04-15 07:13:10,203 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:10,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:10,342 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:12,491 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:12,575 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:12,621 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:12,627 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:13:12,627 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:12,776 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:12,776 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:12,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1696521999, now seen corresponding path program 1 times [2022-04-15 07:13:12,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:12,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731687013] [2022-04-15 07:13:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:12,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:12,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:12,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:12,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:12,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19670#true} {19670#true} #56#return; {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {19670#true} call ULTIMATE.init(); {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:12,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19670#true} {19670#true} #56#return; {19670#true} is VALID [2022-04-15 07:13:12,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {19670#true} call #t~ret7 := main(); {19670#true} is VALID [2022-04-15 07:13:12,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {19670#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {19675#(= main_~a~0 0)} is VALID [2022-04-15 07:13:12,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {19675#(= main_~a~0 0)} [142] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_1029| |v_main_#t~pre5_1023|) (= v_main_~a~0_256 v_main_~a~0_255) (= v_main_~b~0_1346 v_main_~b~0_1339) (= v_main_~c~0_3493 v_main_~c~0_3452) (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|) (= |v_main_#t~pre6_1908| |v_main_#t~pre6_1873|)) InVars {main_~c~0=v_main_~c~0_3493, main_~b~0=v_main_~b~0_1346, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_1029|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_1908|} OutVars{main_~c~0=v_main_~c~0_3452, main_~b~0=v_main_~b~0_1339, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_1023|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_1873|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19675#(= main_~a~0 0)} is VALID [2022-04-15 07:13:12,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {19675#(= main_~a~0 0)} [141] L21-4_primed-->L21-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[] {19671#false} is VALID [2022-04-15 07:13:12,805 INFO L290 TraceCheckUtils]: 8: Hoare triple {19671#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {19671#false} is VALID [2022-04-15 07:13:12,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {19671#false} assume !false; {19671#false} is VALID [2022-04-15 07:13:12,805 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 07:13:12,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:12,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731687013] [2022-04-15 07:13:12,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731687013] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:12,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:12,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:13,999 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:14,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [709997670] [2022-04-15 07:13:14,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [709997670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:14,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:14,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 07:13:14,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413526936] [2022-04-15 07:13:14,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:14,000 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 100 [2022-04-15 07:13:14,000 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:14,000 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 07:13:14,061 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 07:13:14,061 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 07:13:14,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:14,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 07:13:14,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2021, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:13:14,062 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 07:13:19,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:19,218 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-04-15 07:13:19,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 07:13:19,218 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 100 [2022-04-15 07:13:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 07:13:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 128 transitions. [2022-04-15 07:13:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 07:13:19,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 128 transitions. [2022-04-15 07:13:19,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 128 transitions. [2022-04-15 07:13:19,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:19,330 INFO L225 Difference]: With dead ends: 120 [2022-04-15 07:13:19,330 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 07:13:19,331 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=417, Invalid=7773, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 07:13:19,331 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 114 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3784 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:19,331 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 137 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3784 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-15 07:13:19,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 07:13:19,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-04-15 07:13:19,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:19,372 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 07:13:19,372 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 07:13:19,372 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 07:13:19,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:19,373 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-15 07:13:19,373 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-15 07:13:19,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:19,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:19,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 111 states. [2022-04-15 07:13:19,373 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 111 states. [2022-04-15 07:13:19,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:19,374 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-15 07:13:19,374 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-15 07:13:19,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:19,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:19,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:19,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:19,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 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 07:13:19,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2022-04-15 07:13:19,375 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2022-04-15 07:13:19,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:19,376 INFO L478 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-04-15 07:13:19,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 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 07:13:19,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 107 transitions. [2022-04-15 07:13:19,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-04-15 07:13:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 07:13:19,557 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:19,557 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:19,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 07:13:19,557 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:19,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:19,557 INFO L85 PathProgramCache]: Analyzing trace with hash -475437478, now seen corresponding path program 41 times [2022-04-15 07:13:19,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:19,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470565263] [2022-04-15 07:13:21,768 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:21,850 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:25,926 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:25,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:26,048 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:26,077 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:13:26,077 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:30,295 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:30,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:30,383 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:30,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1696583503, now seen corresponding path program 1 times [2022-04-15 07:13:30,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:30,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141628507] [2022-04-15 07:13:30,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:30,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:30,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:30,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20482#true} is VALID [2022-04-15 07:13:30,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {20482#true} assume true; {20482#true} is VALID [2022-04-15 07:13:30,433 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20482#true} {20482#true} #56#return; {20482#true} is VALID [2022-04-15 07:13:30,433 INFO L272 TraceCheckUtils]: 0: Hoare triple {20482#true} call ULTIMATE.init(); {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:30,433 INFO L290 TraceCheckUtils]: 1: Hoare triple {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20482#true} is VALID [2022-04-15 07:13:30,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {20482#true} assume true; {20482#true} is VALID [2022-04-15 07:13:30,434 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20482#true} {20482#true} #56#return; {20482#true} is VALID [2022-04-15 07:13:30,434 INFO L272 TraceCheckUtils]: 4: Hoare triple {20482#true} call #t~ret7 := main(); {20482#true} is VALID [2022-04-15 07:13:30,434 INFO L290 TraceCheckUtils]: 5: Hoare triple {20482#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {20487#(= main_~a~0 0)} is VALID [2022-04-15 07:13:30,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {20487#(= main_~a~0 0)} [144] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse1 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse2 (= v_main_~c~0_3616 v_main_~c~0_3574)) (.cse3 (= |v_main_#t~pre6_1968| |v_main_#t~pre6_1932|)) (.cse4 (= v_main_~b~0_1380 v_main_~b~0_1373)) (.cse5 (= |v_main_#t~pre5_1053| |v_main_#t~pre5_1047|))) (or (and .cse0 (<= 6 v_main_~a~0_262) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (< v_main_~a~0_262 v_main_~a~0_261) (= v_main_~b~0_1373 6) (= 6 v_main_~c~0_3574) (< v_main_~a~0_261 7)))) InVars {main_~c~0=v_main_~c~0_3616, main_~b~0=v_main_~b~0_1380, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_1053|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_1968|} OutVars{main_~c~0=v_main_~c~0_3574, main_~b~0=v_main_~b~0_1373, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_1047|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_1932|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20488#(or (= main_~a~0 0) (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0)))} is VALID [2022-04-15 07:13:30,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {20488#(or (= main_~a~0 0) (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0)))} [143] L21-4_primed-->L21-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[] {20489#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-15 07:13:30,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {20489#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0))} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {20483#false} is VALID [2022-04-15 07:13:30,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {20483#false} assume !false; {20483#false} is VALID [2022-04-15 07:13:30,436 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 07:13:30,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:30,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141628507] [2022-04-15 07:13:30,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141628507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:30,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:30,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:13:32,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:32,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470565263] [2022-04-15 07:13:32,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470565263] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:32,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:32,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 07:13:32,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989840993] [2022-04-15 07:13:32,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:32,657 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 102 [2022-04-15 07:13:32,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:32,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 07:13:32,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:32,728 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 07:13:32,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:32,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 07:13:32,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=2540, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 07:13:32,729 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 07:13:40,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,096 INFO L93 Difference]: Finished difference Result 199 states and 251 transitions. [2022-04-15 07:13:40,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 07:13:40,096 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 102 [2022-04-15 07:13:40,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:40,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 07:13:40,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 162 transitions. [2022-04-15 07:13:40,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 07:13:40,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 162 transitions. [2022-04-15 07:13:40,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 162 transitions. [2022-04-15 07:13:40,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:40,233 INFO L225 Difference]: With dead ends: 199 [2022-04-15 07:13:40,233 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:13:40,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 24 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=301, Invalid=9011, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 07:13:40,234 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 4408 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 4408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:40,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 238 Invalid, 4515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 4408 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 07:13:40,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:13:40,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:13:40,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:40,234 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 07:13:40,234 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 07:13:40,235 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 07:13:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:13:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:13:40,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,235 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 07:13:40,235 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 07:13:40,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,235 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:13:40,235 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:13:40,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:40,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:40,235 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 07:13:40,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:13:40,236 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2022-04-15 07:13:40,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:40,236 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:13:40,236 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 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 07:13:40,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:13:40,236 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 07:13:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:13:40,236 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,238 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:13:40,241 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 07:13:40,242 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.