/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_6.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:08:31,890 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:08:31,892 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:08:31,928 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:08:31,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:08:31,930 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:08:31,931 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:08:31,934 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:08:31,935 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:08:31,939 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:08:31,939 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:08:31,941 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:08:31,941 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:08:31,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:08:31,943 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:08:31,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:08:31,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:08:31,949 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:08:31,950 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:08:31,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:08:31,957 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:08:31,958 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:08:31,958 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:08:31,959 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:08:31,960 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:08:31,965 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:08:31,965 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:08:31,965 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:08:31,966 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:08:31,966 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:08:31,967 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:08:31,967 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:08:31,969 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:08:31,969 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:08:31,969 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:08:31,970 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:08:31,970 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:08:31,970 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:08:31,971 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:08:31,971 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:08:31,971 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:08:31,972 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:08:31,973 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:08:31,982 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:08:31,982 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:08:31,983 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:08:31,983 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:08:31,983 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:08:31,984 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:08:31,984 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:08:31,984 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:08:31,984 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:08:31,984 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:08:31,985 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:08:31,985 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:08:31,985 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:08:31,986 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:08:31,986 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:08:31,986 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:08:31,986 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:08:32,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:08:32,188 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:08:32,190 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:08:32,190 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:08:32,200 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:08:32,201 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-15 07:08:32,246 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6a8c7ae/4021c64d77fa4b3d9be25390a33fa5df/FLAGf7c97b90b [2022-04-15 07:08:32,656 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:08:32,660 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_6.c [2022-04-15 07:08:32,664 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6a8c7ae/4021c64d77fa4b3d9be25390a33fa5df/FLAGf7c97b90b [2022-04-15 07:08:32,673 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd6a8c7ae/4021c64d77fa4b3d9be25390a33fa5df [2022-04-15 07:08:32,675 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:08:32,676 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:08:32,677 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:08:32,677 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:08:32,679 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:08:32,680 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e34fa1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32, skipping insertion in model container [2022-04-15 07:08:32,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,685 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:08:32,693 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:08:32,836 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_6.c[959,972] [2022-04-15 07:08:32,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:08:32,845 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:08:32,855 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_6.c[959,972] [2022-04-15 07:08:32,859 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:08:32,869 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:08:32,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32 WrapperNode [2022-04-15 07:08:32,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:08:32,870 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:08:32,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:08:32,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:08:32,879 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,879 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,885 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,886 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,890 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,900 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:08:32,900 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:08:32,900 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:08:32,901 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:08:32,901 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (1/1) ... [2022-04-15 07:08:32,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:08:32,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:08:32,924 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:08:32,943 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:08:32,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:08:32,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:08:32,973 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:08:32,973 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:08:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:08:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:08:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:08:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:08:32,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:08:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:08:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:08:32,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:08:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:08:32,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:08:33,029 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:08:33,030 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:08:33,135 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:08:33,140 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:08:33,140 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-04-15 07:08:33,141 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:08:33 BoogieIcfgContainer [2022-04-15 07:08:33,141 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:08:33,143 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:08:33,143 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:08:33,145 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:08:33,145 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:08:32" (1/3) ... [2022-04-15 07:08:33,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca30ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:08:33, skipping insertion in model container [2022-04-15 07:08:33,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:08:32" (2/3) ... [2022-04-15 07:08:33,146 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5eca30ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:08:33, skipping insertion in model container [2022-04-15 07:08:33,146 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:08:33" (3/3) ... [2022-04-15 07:08:33,147 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_6.c [2022-04-15 07:08:33,151 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:08:33,151 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:08:33,178 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:08:33,183 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:08:33,183 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:08:33,195 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 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:08:33,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:08:33,200 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:33,200 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:33,201 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:33,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:33,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 1 times [2022-04-15 07:08:33,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:33,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [933733448] [2022-04-15 07:08:33,217 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:08:33,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1187922237, now seen corresponding path program 2 times [2022-04-15 07:08:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:33,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590929606] [2022-04-15 07:08:33,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:33,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:33,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:33,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:33,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29#true} is VALID [2022-04-15 07:08:33,456 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 07:08:33,456 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-15 07:08:33,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {29#true} call ULTIMATE.init(); {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:33,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29#true} is VALID [2022-04-15 07:08:33,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#true} assume true; {29#true} is VALID [2022-04-15 07:08:33,459 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#true} {29#true} #92#return; {29#true} is VALID [2022-04-15 07:08:33,460 INFO L272 TraceCheckUtils]: 4: Hoare triple {29#true} call #t~ret10 := main(); {29#true} is VALID [2022-04-15 07:08:33,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {34#(= main_~a~0 0)} is VALID [2022-04-15 07:08:33,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#(= main_~a~0 0)} assume !(~a~0 < 6); {30#false} is VALID [2022-04-15 07:08:33,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {30#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {30#false} is VALID [2022-04-15 07:08:33,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {30#false} assume !false; {30#false} is VALID [2022-04-15 07:08:33,462 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:33,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:33,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590929606] [2022-04-15 07:08:33,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590929606] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:33,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:33,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:33,468 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:33,469 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [933733448] [2022-04-15 07:08:33,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [933733448] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:33,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:33,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:33,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637880470] [2022-04-15 07:08:33,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:33,475 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:08:33,476 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:33,478 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:08:33,501 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:08:33,501 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:08:33,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:33,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:08:33,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:08:33,532 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.7) internal successors, (34), 21 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:33,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:33,715 INFO L93 Difference]: Finished difference Result 58 states and 94 transitions. [2022-04-15 07:08:33,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:08:33,715 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:08:33,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:33,717 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:08:33,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 07:08:33,735 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:08:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 07:08:33,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 07:08:33,822 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:08:33,832 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:08:33,833 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 07:08:33,835 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:08:33,839 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 56 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:33,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 38 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:08:33,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 07:08:33,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 22. [2022-04-15 07:08:33,871 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:33,871 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call 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:33,872 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call 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:33,872 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call 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:33,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:33,874 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 07:08:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 07:08:33,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:33,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:33,875 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 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:33,875 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 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:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:33,878 INFO L93 Difference]: Finished difference Result 33 states and 43 transitions. [2022-04-15 07:08:33,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 43 transitions. [2022-04-15 07:08:33,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:33,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:33,878 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:33,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:33,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 2 states have call successors, (2), 2 states have call 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:33,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 27 transitions. [2022-04-15 07:08:33,884 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 27 transitions. Word has length 9 [2022-04-15 07:08:33,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:33,884 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 27 transitions. [2022-04-15 07:08:33,884 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:08:33,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 27 transitions. [2022-04-15 07:08:33,913 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:33,915 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 27 transitions. [2022-04-15 07:08:33,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 07:08:33,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:33,916 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:33,916 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:08:33,917 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:33,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:33,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1138963186, now seen corresponding path program 1 times [2022-04-15 07:08:33,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:33,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1008833317] [2022-04-15 07:08:34,041 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:34,042 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:34,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1831600555, now seen corresponding path program 1 times [2022-04-15 07:08:34,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:34,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109899233] [2022-04-15 07:08:34,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:34,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:34,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:34,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {266#true} is VALID [2022-04-15 07:08:34,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 07:08:34,132 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-15 07:08:34,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:34,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {272#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {266#true} is VALID [2022-04-15 07:08:34,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2022-04-15 07:08:34,135 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #92#return; {266#true} is VALID [2022-04-15 07:08:34,135 INFO L272 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret10 := main(); {266#true} is VALID [2022-04-15 07:08:34,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {266#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {271#(= main_~a~0 0)} is VALID [2022-04-15 07:08:34,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {271#(= main_~a~0 0)} [96] L23-3-->L23-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] {271#(= main_~a~0 0)} is VALID [2022-04-15 07:08:34,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {271#(= main_~a~0 0)} [95] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {267#false} is VALID [2022-04-15 07:08:34,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {267#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {267#false} is VALID [2022-04-15 07:08:34,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {267#false} assume !false; {267#false} is VALID [2022-04-15 07:08:34,139 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:34,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:34,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109899233] [2022-04-15 07:08:34,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109899233] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:34,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:34,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:34,162 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:34,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1008833317] [2022-04-15 07:08:34,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1008833317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:34,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:34,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 07:08:34,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999636588] [2022-04-15 07:08:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:34,165 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:08:34,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:34,165 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:08:34,174 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:08:34,174 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 07:08:34,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:34,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 07:08:34,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:08:34,175 INFO L87 Difference]: Start difference. First operand 22 states and 27 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:08:34,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,314 INFO L93 Difference]: Finished difference Result 58 states and 78 transitions. [2022-04-15 07:08:34,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 07:08:34,314 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:08:34,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:34,315 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:08:34,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 07:08:34,319 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:08:34,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 78 transitions. [2022-04-15 07:08:34,322 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 78 transitions. [2022-04-15 07:08:34,382 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:08:34,385 INFO L225 Difference]: With dead ends: 58 [2022-04-15 07:08:34,385 INFO L226 Difference]: Without dead ends: 43 [2022-04-15 07:08:34,385 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:08:34,388 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 92 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:34,389 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 29 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:08:34,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-15 07:08:34,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 23. [2022-04-15 07:08:34,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:34,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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:34,406 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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:34,408 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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:34,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,415 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-15 07:08:34,416 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-15 07:08:34,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:34,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:34,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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 43 states. [2022-04-15 07:08:34,418 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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 43 states. [2022-04-15 07:08:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,421 INFO L93 Difference]: Finished difference Result 43 states and 57 transitions. [2022-04-15 07:08:34,421 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 57 transitions. [2022-04-15 07:08:34,421 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:34,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:34,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:34,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:34,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 19 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:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2022-04-15 07:08:34,427 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 12 [2022-04-15 07:08:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:34,427 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2022-04-15 07:08:34,427 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:08:34,427 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 28 transitions. [2022-04-15 07:08:34,451 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:34,451 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2022-04-15 07:08:34,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 07:08:34,452 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:34,452 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:34,452 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:08:34,453 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:34,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:34,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1811082743, now seen corresponding path program 1 times [2022-04-15 07:08:34,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:34,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113173992] [2022-04-15 07:08:34,504 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:34,571 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:08:34,572 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:34,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1831662059, now seen corresponding path program 1 times [2022-04-15 07:08:34,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:34,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359858257] [2022-04-15 07:08:34,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:34,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:34,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:34,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:34,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:34,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {528#true} is VALID [2022-04-15 07:08:34,606 INFO L290 TraceCheckUtils]: 1: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-15 07:08:34,606 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {528#true} {528#true} #92#return; {528#true} is VALID [2022-04-15 07:08:34,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {528#true} call ULTIMATE.init(); {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:34,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {534#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {528#true} is VALID [2022-04-15 07:08:34,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {528#true} assume true; {528#true} is VALID [2022-04-15 07:08:34,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {528#true} {528#true} #92#return; {528#true} is VALID [2022-04-15 07:08:34,608 INFO L272 TraceCheckUtils]: 4: Hoare triple {528#true} call #t~ret10 := main(); {528#true} is VALID [2022-04-15 07:08:34,608 INFO L290 TraceCheckUtils]: 5: Hoare triple {528#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {533#(= main_~a~0 0)} is VALID [2022-04-15 07:08:34,609 INFO L290 TraceCheckUtils]: 6: Hoare triple {533#(= main_~a~0 0)} [98] L23-3-->L23-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] {533#(= main_~a~0 0)} is VALID [2022-04-15 07:08:34,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {533#(= main_~a~0 0)} [97] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {529#false} is VALID [2022-04-15 07:08:34,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {529#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {529#false} is VALID [2022-04-15 07:08:34,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {529#false} assume !false; {529#false} is VALID [2022-04-15 07:08:34,609 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:34,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:34,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359858257] [2022-04-15 07:08:34,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359858257] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:34,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:34,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:34,633 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113173992] [2022-04-15 07:08:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113173992] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:34,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:34,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:08:34,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078226290] [2022-04-15 07:08:34,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:34,634 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:08:34,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:34,635 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:08:34,644 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:08:34,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 07:08:34,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:34,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 07:08:34,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-15 07:08:34,645 INFO L87 Difference]: Start difference. First operand 23 states and 28 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:08:34,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,810 INFO L93 Difference]: Finished difference Result 66 states and 89 transitions. [2022-04-15 07:08:34,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 07:08:34,810 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:08:34,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:34,811 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:08:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 07:08:34,813 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:08:34,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 89 transitions. [2022-04-15 07:08:34,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 89 transitions. [2022-04-15 07:08:34,876 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:08:34,878 INFO L225 Difference]: With dead ends: 66 [2022-04-15 07:08:34,879 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 07:08:34,879 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:08:34,881 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 112 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:34,882 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 32 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:34,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 07:08:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 24. [2022-04-15 07:08:34,892 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:34,893 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call 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:34,894 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call 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:34,894 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call 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:34,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,897 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 07:08:34,897 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 07:08:34,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:34,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:34,901 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 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:08:34,901 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 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:08:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:34,905 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 07:08:34,905 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 07:08:34,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:34,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:34,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:34,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.3) internal successors, (26), 20 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call 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:34,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-04-15 07:08:34,907 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 15 [2022-04-15 07:08:34,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:34,907 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-04-15 07:08:34,907 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:08:34,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 29 transitions. [2022-04-15 07:08:34,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-04-15 07:08:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 07:08:34,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:34,934 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:34,934 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:08:34,936 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:34,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:34,937 INFO L85 PathProgramCache]: Analyzing trace with hash 602992382, now seen corresponding path program 1 times [2022-04-15 07:08:34,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:34,937 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1387251582] [2022-04-15 07:08:34,965 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:34,990 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:35,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 4 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=3}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:35,057 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:35,058 INFO L85 PathProgramCache]: Analyzing trace with hash 1831723563, now seen corresponding path program 1 times [2022-04-15 07:08:35,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:35,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514768205] [2022-04-15 07:08:35,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:35,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:35,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:35,087 INFO L290 TraceCheckUtils]: 0: Hoare triple {833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {827#true} is VALID [2022-04-15 07:08:35,087 INFO L290 TraceCheckUtils]: 1: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-15 07:08:35,087 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {827#true} {827#true} #92#return; {827#true} is VALID [2022-04-15 07:08:35,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {827#true} call ULTIMATE.init(); {833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:35,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {827#true} is VALID [2022-04-15 07:08:35,088 INFO L290 TraceCheckUtils]: 2: Hoare triple {827#true} assume true; {827#true} is VALID [2022-04-15 07:08:35,088 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {827#true} {827#true} #92#return; {827#true} is VALID [2022-04-15 07:08:35,088 INFO L272 TraceCheckUtils]: 4: Hoare triple {827#true} call #t~ret10 := main(); {827#true} is VALID [2022-04-15 07:08:35,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {827#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {832#(= main_~a~0 0)} is VALID [2022-04-15 07:08:35,089 INFO L290 TraceCheckUtils]: 6: Hoare triple {832#(= main_~a~0 0)} [100] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre6_16| |v_main_#t~pre6_15|) (= |v_main_#t~pre5_16| |v_main_#t~pre5_15|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|) (= v_main_~d~0_22 v_main_~d~0_21) (= v_main_~c~0_36 v_main_~c~0_34) (= v_main_~b~0_31 v_main_~b~0_29)) InVars {main_~c~0=v_main_~c~0_36, main_~d~0=v_main_~d~0_22, main_~b~0=v_main_~b~0_31, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_16|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_16|} OutVars{main_~c~0=v_main_~c~0_34, main_~d~0=v_main_~d~0_21, main_~b~0=v_main_~b~0_29, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_15|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_15|} AuxVars[] AssignedVars[main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {832#(= main_~a~0 0)} is VALID [2022-04-15 07:08:35,089 INFO L290 TraceCheckUtils]: 7: Hoare triple {832#(= main_~a~0 0)} [99] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {828#false} is VALID [2022-04-15 07:08:35,089 INFO L290 TraceCheckUtils]: 8: Hoare triple {828#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {828#false} is VALID [2022-04-15 07:08:35,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {828#false} assume !false; {828#false} is VALID [2022-04-15 07:08:35,090 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:35,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:35,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514768205] [2022-04-15 07:08:35,090 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514768205] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:35,090 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:35,090 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:35,123 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:35,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1387251582] [2022-04-15 07:08:35,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1387251582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:35,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:35,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:08:35,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319409482] [2022-04-15 07:08:35,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:35,123 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-15 07:08:35,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:35,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:35,135 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:08:35,135 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:08:35,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:35,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:08:35,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-15 07:08:35,136 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:35,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:35,320 INFO L93 Difference]: Finished difference Result 72 states and 97 transitions. [2022-04-15 07:08:35,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:08:35,320 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 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 18 [2022-04-15 07:08:35,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:35,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 07:08:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-04-15 07:08:35,323 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-04-15 07:08:35,398 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:08:35,399 INFO L225 Difference]: With dead ends: 72 [2022-04-15 07:08:35,399 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 07:08:35,400 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:08:35,400 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 150 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:35,400 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 25 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:35,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 07:08:35,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 25. [2022-04-15 07:08:35,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:35,405 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:35,405 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:35,405 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:35,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:35,407 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-15 07:08:35,407 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-04-15 07:08:35,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:35,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:35,407 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 57 states. [2022-04-15 07:08:35,407 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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 57 states. [2022-04-15 07:08:35,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:35,409 INFO L93 Difference]: Finished difference Result 57 states and 76 transitions. [2022-04-15 07:08:35,409 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 76 transitions. [2022-04-15 07:08:35,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:35,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:35,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:35,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:35,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 21 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:35,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-04-15 07:08:35,410 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 18 [2022-04-15 07:08:35,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:35,410 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-04-15 07:08:35,410 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:35,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 30 transitions. [2022-04-15 07:08:35,434 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:35,435 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-15 07:08:35,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 07:08:35,435 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:35,435 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:35,435 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-15 07:08:35,435 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:35,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:35,436 INFO L85 PathProgramCache]: Analyzing trace with hash 257821531, now seen corresponding path program 1 times [2022-04-15 07:08:35,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:35,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1367607750] [2022-04-15 07:08:35,468 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:35,492 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:35,524 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:35,554 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:35,586 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:35,672 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 5 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=4}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:35,673 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:35,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1831785067, now seen corresponding path program 1 times [2022-04-15 07:08:35,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:35,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415805710] [2022-04-15 07:08:35,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:35,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:35,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:35,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:35,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:35,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1155#true} is VALID [2022-04-15 07:08:35,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 07:08:35,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1155#true} {1155#true} #92#return; {1155#true} is VALID [2022-04-15 07:08:35,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {1155#true} call ULTIMATE.init(); {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:35,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {1161#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1155#true} is VALID [2022-04-15 07:08:35,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#true} assume true; {1155#true} is VALID [2022-04-15 07:08:35,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1155#true} {1155#true} #92#return; {1155#true} is VALID [2022-04-15 07:08:35,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {1155#true} call #t~ret10 := main(); {1155#true} is VALID [2022-04-15 07:08:35,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1160#(= main_~a~0 0)} is VALID [2022-04-15 07:08:35,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {1160#(= main_~a~0 0)} [102] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|) (= |v_main_#t~pre7_32| |v_main_#t~pre7_31|) (= |v_main_#t~pre5_22| |v_main_#t~pre5_21|) (= |v_main_#t~pre6_33| |v_main_#t~pre6_32|) (= v_main_~a~0_28 v_main_~a~0_27) (= v_main_~d~0_59 v_main_~d~0_57) (= v_main_~b~0_39 v_main_~b~0_37) (= v_main_~c~0_56 v_main_~c~0_54) (= v_main_~e~0_38 v_main_~e~0_37)) InVars {main_~e~0=v_main_~e~0_38, main_#t~pre7=|v_main_#t~pre7_32|, main_~c~0=v_main_~c~0_56, main_~d~0=v_main_~d~0_59, main_~b~0=v_main_~b~0_39, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_22|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_33|} OutVars{main_~e~0=v_main_~e~0_37, main_#t~pre7=|v_main_#t~pre7_31|, main_~c~0=v_main_~c~0_54, main_~d~0=v_main_~d~0_57, main_~b~0=v_main_~b~0_37, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_32|} AuxVars[] AssignedVars[main_~e~0, main_#t~pre7, main_~c~0, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1160#(= main_~a~0 0)} is VALID [2022-04-15 07:08:35,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1160#(= main_~a~0 0)} [101] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1156#false} is VALID [2022-04-15 07:08:35,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1156#false} is VALID [2022-04-15 07:08:35,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-04-15 07:08:35,703 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:35,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:35,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415805710] [2022-04-15 07:08:35,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415805710] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:35,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:35,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:35,751 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:35,751 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1367607750] [2022-04-15 07:08:35,751 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1367607750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:35,751 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:35,751 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 07:08:35,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659060050] [2022-04-15 07:08:35,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:35,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:35,752 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:35,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:35,764 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:35,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 07:08:35,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:35,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 07:08:35,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 07:08:35,765 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:35,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:35,998 INFO L93 Difference]: Finished difference Result 76 states and 102 transitions. [2022-04-15 07:08:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 07:08:35,999 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:35,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:35,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:36,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-04-15 07:08:36,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:36,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 102 transitions. [2022-04-15 07:08:36,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 102 transitions. [2022-04-15 07:08:36,080 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:08:36,081 INFO L225 Difference]: With dead ends: 76 [2022-04-15 07:08:36,081 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 07:08:36,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:08:36,081 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 153 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:36,082 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 28 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:36,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 07:08:36,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 26. [2022-04-15 07:08:36,085 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:36,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:36,086 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:36,086 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:36,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:36,087 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-15 07:08:36,087 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-15 07:08:36,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:36,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:36,088 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 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 61 states. [2022-04-15 07:08:36,088 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 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 61 states. [2022-04-15 07:08:36,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:36,089 INFO L93 Difference]: Finished difference Result 61 states and 81 transitions. [2022-04-15 07:08:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 81 transitions. [2022-04-15 07:08:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:36,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:36,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:36,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:36,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call 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:36,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-04-15 07:08:36,090 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 21 [2022-04-15 07:08:36,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:36,090 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-04-15 07:08:36,090 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 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:36,090 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 31 transitions. [2022-04-15 07:08:36,116 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-04-15 07:08:36,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-15 07:08:36,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:36,117 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:36,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-15 07:08:36,117 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:36,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:36,117 INFO L85 PathProgramCache]: Analyzing trace with hash 479277370, now seen corresponding path program 1 times [2022-04-15 07:08:36,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:36,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526409434] [2022-04-15 07:08:36,155 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:36,178 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:36,208 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,234 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:36,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,309 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 7 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,345 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:36,382 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 7 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,549 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 5 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:36,549 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1831846571, now seen corresponding path program 1 times [2022-04-15 07:08:36,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:36,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462331374] [2022-04-15 07:08:36,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:36,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:36,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:36,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:36,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:36,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {1510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1504#true} is VALID [2022-04-15 07:08:36,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 07:08:36,579 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1504#true} {1504#true} #92#return; {1504#true} is VALID [2022-04-15 07:08:36,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {1504#true} call ULTIMATE.init(); {1510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:36,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {1510#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1504#true} is VALID [2022-04-15 07:08:36,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {1504#true} assume true; {1504#true} is VALID [2022-04-15 07:08:36,579 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1504#true} {1504#true} #92#return; {1504#true} is VALID [2022-04-15 07:08:36,579 INFO L272 TraceCheckUtils]: 4: Hoare triple {1504#true} call #t~ret10 := main(); {1504#true} is VALID [2022-04-15 07:08:36,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {1504#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1509#(= main_~a~0 0)} is VALID [2022-04-15 07:08:36,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {1509#(= main_~a~0 0)} [104] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_47 v_main_~b~0_45)) (.cse1 (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|)) (.cse2 (= |v_main_#t~pre8_53| |v_main_#t~pre8_52|)) (.cse3 (= |v_main_#t~pre5_28| |v_main_#t~pre5_27|)) (.cse4 (= v_main_~c~0_76 v_main_~c~0_74)) (.cse5 (= v_main_~e~0_97 v_main_~e~0_95)) (.cse6 (= v_main_~d~0_96 v_main_~d~0_94)) (.cse7 (= |v_main_#t~pre7_65| |v_main_#t~pre7_64|)) (.cse8 (= v_main_~f~0_59 v_main_~f~0_58)) (.cse9 (= v_main_~a~0_34 v_main_~a~0_33))) (or (and .cse0 (= |v_main_#t~pre6_50| |v_main_#t~pre6_49|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_49| |v_main_#t~pre6_50|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_97, main_~f~0=v_main_~f~0_59, main_#t~pre7=|v_main_#t~pre7_65|, main_~c~0=v_main_~c~0_76, main_#t~pre8=|v_main_#t~pre8_53|, main_~d~0=v_main_~d~0_96, main_~b~0=v_main_~b~0_47, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_28|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_50|} OutVars{main_~e~0=v_main_~e~0_95, main_~f~0=v_main_~f~0_58, main_#t~pre7=|v_main_#t~pre7_64|, main_~c~0=v_main_~c~0_74, main_#t~pre8=|v_main_#t~pre8_52|, main_~d~0=v_main_~d~0_94, main_~b~0=v_main_~b~0_45, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_27|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_49|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1509#(= main_~a~0 0)} is VALID [2022-04-15 07:08:36,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {1509#(= main_~a~0 0)} [103] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1505#false} is VALID [2022-04-15 07:08:36,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {1505#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1505#false} is VALID [2022-04-15 07:08:36,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {1505#false} assume !false; {1505#false} is VALID [2022-04-15 07:08:36,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:08:36,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:36,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462331374] [2022-04-15 07:08:36,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462331374] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:36,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:36,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:36,642 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:36,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526409434] [2022-04-15 07:08:36,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526409434] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:36,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:36,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 07:08:36,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357203296] [2022-04-15 07:08:36,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:36,643 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 07:08:36,643 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:36,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:36,658 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:08:36,659 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 07:08:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:36,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 07:08:36,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:08:36,659 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:36,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:36,910 INFO L93 Difference]: Finished difference Result 78 states and 104 transitions. [2022-04-15 07:08:36,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 07:08:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-15 07:08:36,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 07:08:36,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:36,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 104 transitions. [2022-04-15 07:08:36,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 104 transitions. [2022-04-15 07:08:36,982 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:08:36,983 INFO L225 Difference]: With dead ends: 78 [2022-04-15 07:08:36,983 INFO L226 Difference]: Without dead ends: 63 [2022-04-15 07:08:36,983 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 07:08:36,984 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 178 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:36,984 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [178 Valid, 26 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:36,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-15 07:08:36,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 27. [2022-04-15 07:08:36,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:36,988 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call 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:36,988 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call 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:36,988 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call 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:36,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:36,990 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-15 07:08:36,990 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-15 07:08:36,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:36,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:36,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 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 63 states. [2022-04-15 07:08:36,990 INFO L87 Difference]: Start difference. First operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 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 63 states. [2022-04-15 07:08:36,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:36,991 INFO L93 Difference]: Finished difference Result 63 states and 83 transitions. [2022-04-15 07:08:36,991 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 83 transitions. [2022-04-15 07:08:36,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:36,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:36,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:36,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:36,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.2608695652173914) internal successors, (29), 23 states have internal predecessors, (29), 2 states have call successors, (2), 2 states have call 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:36,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-15 07:08:36,992 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 24 [2022-04-15 07:08:36,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:36,992 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-15 07:08:36,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:36,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 32 transitions. [2022-04-15 07:08:37,030 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:37,030 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 07:08:37,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 07:08:37,031 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:37,031 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:37,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-15 07:08:37,031 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:37,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:37,031 INFO L85 PathProgramCache]: Analyzing trace with hash 939861656, now seen corresponding path program 1 times [2022-04-15 07:08:37,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:37,031 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [991953750] [2022-04-15 07:08:41,147 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:41,226 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,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:08:45,390 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:45,444 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:45,481 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:47,573 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:47,637 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:47,676 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:51,750 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:51,805 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:51,842 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,246 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:08:54,328 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,479 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:54,479 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:54,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1831908075, now seen corresponding path program 1 times [2022-04-15 07:08:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:54,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283342106] [2022-04-15 07:08:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:54,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:54,517 INFO L290 TraceCheckUtils]: 0: Hoare triple {1872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1866#true} is VALID [2022-04-15 07:08:54,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1866#true} assume true; {1866#true} is VALID [2022-04-15 07:08:54,518 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1866#true} {1866#true} #92#return; {1866#true} is VALID [2022-04-15 07:08:54,518 INFO L272 TraceCheckUtils]: 0: Hoare triple {1866#true} call ULTIMATE.init(); {1872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:54,518 INFO L290 TraceCheckUtils]: 1: Hoare triple {1872#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {1866#true} is VALID [2022-04-15 07:08:54,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {1866#true} assume true; {1866#true} is VALID [2022-04-15 07:08:54,519 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1866#true} {1866#true} #92#return; {1866#true} is VALID [2022-04-15 07:08:54,519 INFO L272 TraceCheckUtils]: 4: Hoare triple {1866#true} call #t~ret10 := main(); {1866#true} is VALID [2022-04-15 07:08:54,519 INFO L290 TraceCheckUtils]: 5: Hoare triple {1866#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {1871#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,520 INFO L290 TraceCheckUtils]: 6: Hoare triple {1871#(= main_~a~0 0)} [106] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_34| |v_main_#t~pre5_33|)) (.cse1 (= v_main_~f~0_120 v_main_~f~0_118)) (.cse2 (= |v_main_#t~pre6_57| |v_main_#t~pre6_56|)) (.cse3 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse4 (= v_main_~b~0_55 v_main_~b~0_53)) (.cse5 (= |v_main_#t~pre7_73| |v_main_#t~pre7_72|)) (.cse6 (= |v_main_#t~pre8_82| |v_main_#t~pre8_81|)) (.cse7 (= |v_main_#t~pre9_54| |v_main_#t~pre9_53|)) (.cse8 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|)) (.cse9 (= v_main_~d~0_108 v_main_~d~0_106)) (.cse10 (= v_main_~c~0_86 v_main_~c~0_84))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_131 v_main_~e~0_129) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= v_main_~e~0_129 v_main_~e~0_131) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_131, main_~d~0=v_main_~d~0_108, main_~b~0=v_main_~b~0_55, main_~f~0=v_main_~f~0_120, main_#t~pre7=|v_main_#t~pre7_73|, main_~c~0=v_main_~c~0_86, main_#t~pre8=|v_main_#t~pre8_82|, main_#t~pre9=|v_main_#t~pre9_54|, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_34|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_57|} OutVars{main_~e~0=v_main_~e~0_129, main_~d~0=v_main_~d~0_106, main_~b~0=v_main_~b~0_53, main_~f~0=v_main_~f~0_118, main_#t~pre7=|v_main_#t~pre7_72|, main_~c~0=v_main_~c~0_84, main_#t~pre8=|v_main_#t~pre8_81|, main_#t~pre9=|v_main_#t~pre9_53|, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_33|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_56|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1871#(= main_~a~0 0)} is VALID [2022-04-15 07:08:54,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {1871#(= main_~a~0 0)} [105] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {1867#false} is VALID [2022-04-15 07:08:54,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1867#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {1867#false} is VALID [2022-04-15 07:08:54,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1867#false} assume !false; {1867#false} is VALID [2022-04-15 07:08:54,522 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,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:54,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283342106] [2022-04-15 07:08:54,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283342106] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:54,622 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:54,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [991953750] [2022-04-15 07:08:54,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [991953750] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:54,622 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:54,622 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 07:08:54,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013474341] [2022-04-15 07:08:54,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:54,623 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 07:08:54,624 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:54,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:54,643 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:54,644 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 07:08:54,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:54,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 07:08:54,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=53, Unknown=0, NotChecked=0, Total=90 [2022-04-15 07:08:54,644 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:54,941 INFO L93 Difference]: Finished difference Result 80 states and 106 transitions. [2022-04-15 07:08:54,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 07:08:54,941 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-04-15 07:08:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:54,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:54,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 07:08:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 106 transitions. [2022-04-15 07:08:54,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 106 transitions. [2022-04-15 07:08:55,018 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:08:55,019 INFO L225 Difference]: With dead ends: 80 [2022-04-15 07:08:55,019 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 07:08:55,019 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=167, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:08:55,020 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 144 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:55,020 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 31 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 07:08:55,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 29. [2022-04-15 07:08:55,056 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:55,056 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:55,056 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:55,056 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:55,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,058 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-15 07:08:55,058 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-15 07:08:55,058 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,058 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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 65 states. [2022-04-15 07:08:55,058 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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 65 states. [2022-04-15 07:08:55,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:55,059 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-15 07:08:55,059 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-15 07:08:55,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:55,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:55,060 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:55,060 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:55,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.24) internal successors, (31), 25 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:55,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-04-15 07:08:55,060 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 26 [2022-04-15 07:08:55,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:55,060 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-04-15 07:08:55,061 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 9 states have internal predecessors, (23), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:55,061 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 34 transitions. [2022-04-15 07:08:55,095 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:55,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-15 07:08:55,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-15 07:08:55,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:55,095 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:55,096 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-15 07:08:55,096 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:55,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:55,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1179729014, now seen corresponding path program 2 times [2022-04-15 07:08:55,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:55,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [309594441] [2022-04-15 07:08:55,246 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:55,283 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:55,378 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:55,415 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:55,507 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:55,544 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:55,638 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:55,675 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:55,770 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:55,916 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:55,917 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1831969579, now seen corresponding path program 1 times [2022-04-15 07:08:55,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:55,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437990609] [2022-04-15 07:08:55,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:55,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:55,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:55,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {2249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2243#true} is VALID [2022-04-15 07:08:55,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {2243#true} assume true; {2243#true} is VALID [2022-04-15 07:08:55,946 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2243#true} {2243#true} #92#return; {2243#true} is VALID [2022-04-15 07:08:55,946 INFO L272 TraceCheckUtils]: 0: Hoare triple {2243#true} call ULTIMATE.init(); {2249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:55,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {2249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2243#true} is VALID [2022-04-15 07:08:55,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {2243#true} assume true; {2243#true} is VALID [2022-04-15 07:08:55,946 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2243#true} {2243#true} #92#return; {2243#true} is VALID [2022-04-15 07:08:55,946 INFO L272 TraceCheckUtils]: 4: Hoare triple {2243#true} call #t~ret10 := main(); {2243#true} is VALID [2022-04-15 07:08:55,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {2243#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {2248#(= main_~a~0 0)} is VALID [2022-04-15 07:08:55,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {2248#(= main_~a~0 0)} [108] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_120 v_main_~d~0_118)) (.cse1 (= v_main_~f~0_189 v_main_~f~0_186)) (.cse2 (= |v_main_#t~pre6_64| |v_main_#t~pre6_63|)) (.cse3 (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|)) (.cse4 (= |v_main_#t~pre9_115| |v_main_#t~pre9_113|)) (.cse5 (= |v_main_#t~pre8_111| |v_main_#t~pre8_110|)) (.cse6 (= v_main_~c~0_96 v_main_~c~0_94)) (.cse7 (= |v_main_#t~pre7_81| |v_main_#t~pre7_80|)) (.cse8 (= v_main_~e~0_165 v_main_~e~0_163)) (.cse9 (= v_main_~a~0_46 v_main_~a~0_45)) (.cse10 (= v_main_~b~0_63 v_main_~b~0_61))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre5_40| |v_main_#t~pre5_39|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= |v_main_#t~pre5_39| |v_main_#t~pre5_40|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_165, main_~d~0=v_main_~d~0_120, main_~b~0=v_main_~b~0_63, main_~f~0=v_main_~f~0_189, main_#t~pre7=|v_main_#t~pre7_81|, main_~c~0=v_main_~c~0_96, main_#t~pre8=|v_main_#t~pre8_111|, main_#t~pre9=|v_main_#t~pre9_115|, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_40|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_64|} OutVars{main_~e~0=v_main_~e~0_163, main_~d~0=v_main_~d~0_118, main_~b~0=v_main_~b~0_61, main_~f~0=v_main_~f~0_186, main_#t~pre7=|v_main_#t~pre7_80|, main_~c~0=v_main_~c~0_94, main_#t~pre8=|v_main_#t~pre8_110|, main_#t~pre9=|v_main_#t~pre9_113|, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_39|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_63|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2248#(= main_~a~0 0)} is VALID [2022-04-15 07:08:55,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2248#(= main_~a~0 0)} [107] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2244#false} is VALID [2022-04-15 07:08:55,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2244#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {2244#false} is VALID [2022-04-15 07:08:55,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {2244#false} assume !false; {2244#false} is VALID [2022-04-15 07:08:55,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:55,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:55,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437990609] [2022-04-15 07:08:55,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437990609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:55,948 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:55,948 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:56,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:56,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [309594441] [2022-04-15 07:08:56,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [309594441] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:56,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:56,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 07:08:56,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789871944] [2022-04-15 07:08:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:56,074 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 07:08:56,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:56,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:56,094 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:56,095 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 07:08:56,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:56,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 07:08:56,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=66, Unknown=0, NotChecked=0, Total=110 [2022-04-15 07:08:56,096 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:56,448 INFO L93 Difference]: Finished difference Result 82 states and 108 transitions. [2022-04-15 07:08:56,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 07:08:56,448 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 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 28 [2022-04-15 07:08:56,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:56,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-04-15 07:08:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:56,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 108 transitions. [2022-04-15 07:08:56,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 108 transitions. [2022-04-15 07:08:56,511 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:08:56,512 INFO L225 Difference]: With dead ends: 82 [2022-04-15 07:08:56,512 INFO L226 Difference]: Without dead ends: 67 [2022-04-15 07:08:56,512 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:08:56,513 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 202 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:56,513 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [202 Valid, 21 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:56,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-15 07:08:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 31. [2022-04-15 07:08:56,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:56,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call 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:56,518 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call 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:56,518 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call 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:56,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:56,521 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-15 07:08:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-15 07:08:56,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:56,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:56,521 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 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:08:56,522 INFO L87 Difference]: Start difference. First operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 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:08:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:56,523 INFO L93 Difference]: Finished difference Result 67 states and 87 transitions. [2022-04-15 07:08:56,523 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 87 transitions. [2022-04-15 07:08:56,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:56,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:56,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:56,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:56,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call 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:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-04-15 07:08:56,524 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 28 [2022-04-15 07:08:56,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:56,524 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-04-15 07:08:56,524 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 1 states have call successors, (2), 2 states have call 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:56,524 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 36 transitions. [2022-04-15 07:08:56,570 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:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 07:08:56,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 07:08:56,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:56,571 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:56,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-15 07:08:56,571 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:56,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:56,571 INFO L85 PathProgramCache]: Analyzing trace with hash -235973932, now seen corresponding path program 3 times [2022-04-15 07:08:56,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:56,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1532719462] [2022-04-15 07:08:56,705 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:56,744 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:56,840 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:56,878 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:56,976 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:57,016 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:57,124 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:57,166 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:57,270 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:57,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:08:57,408 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:08:57,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1832031083, now seen corresponding path program 1 times [2022-04-15 07:08:57,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:08:57,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [103555308] [2022-04-15 07:08:57,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:08:57,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:08:57,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:57,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:08:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:08:57,437 INFO L290 TraceCheckUtils]: 0: Hoare triple {2641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2635#true} is VALID [2022-04-15 07:08:57,437 INFO L290 TraceCheckUtils]: 1: Hoare triple {2635#true} assume true; {2635#true} is VALID [2022-04-15 07:08:57,438 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2635#true} {2635#true} #92#return; {2635#true} is VALID [2022-04-15 07:08:57,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {2635#true} call ULTIMATE.init(); {2641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:08:57,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2641#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {2635#true} is VALID [2022-04-15 07:08:57,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {2635#true} assume true; {2635#true} is VALID [2022-04-15 07:08:57,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2635#true} {2635#true} #92#return; {2635#true} is VALID [2022-04-15 07:08:57,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {2635#true} call #t~ret10 := main(); {2635#true} is VALID [2022-04-15 07:08:57,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {2635#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {2640#(= main_~a~0 0)} is VALID [2022-04-15 07:08:57,439 INFO L290 TraceCheckUtils]: 6: Hoare triple {2640#(= main_~a~0 0)} [110] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_71| |v_main_#t~pre6_70|)) (.cse1 (= v_main_~f~0_264 v_main_~f~0_260)) (.cse2 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse3 (= v_main_~c~0_106 v_main_~c~0_104)) (.cse4 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse5 (= |v_main_#t~pre7_89| |v_main_#t~pre7_88|)) (.cse6 (= v_main_~b~0_71 v_main_~b~0_69)) (.cse7 (= v_main_~d~0_132 v_main_~d~0_130)) (.cse8 (= v_main_~e~0_199 v_main_~e~0_197)) (.cse9 (= |v_main_#t~pre5_46| |v_main_#t~pre5_45|))) (or (and .cse0 (= |v_main_#t~pre8_139| |v_main_#t~pre8_140|) .cse1 .cse2 .cse3 (= |v_main_#t~pre9_178| |v_main_#t~pre9_181|) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |v_main_#t~pre8_140| |v_main_#t~pre8_139|) .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_181| |v_main_#t~pre9_178|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_199, main_~d~0=v_main_~d~0_132, main_~b~0=v_main_~b~0_71, main_~f~0=v_main_~f~0_264, main_#t~pre7=|v_main_#t~pre7_89|, main_~c~0=v_main_~c~0_106, main_#t~pre8=|v_main_#t~pre8_140|, main_#t~pre9=|v_main_#t~pre9_181|, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_46|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_71|} OutVars{main_~e~0=v_main_~e~0_197, main_~d~0=v_main_~d~0_130, main_~b~0=v_main_~b~0_69, main_~f~0=v_main_~f~0_260, main_#t~pre7=|v_main_#t~pre7_88|, main_~c~0=v_main_~c~0_104, main_#t~pre8=|v_main_#t~pre8_139|, main_#t~pre9=|v_main_#t~pre9_178|, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_45|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_70|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2640#(= main_~a~0 0)} is VALID [2022-04-15 07:08:57,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {2640#(= main_~a~0 0)} [109] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {2636#false} is VALID [2022-04-15 07:08:57,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {2636#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {2636#false} is VALID [2022-04-15 07:08:57,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {2636#false} assume !false; {2636#false} is VALID [2022-04-15 07:08:57,440 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:57,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:08:57,440 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [103555308] [2022-04-15 07:08:57,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [103555308] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:57,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:57,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:08:57,592 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:08:57,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1532719462] [2022-04-15 07:08:57,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1532719462] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:08:57,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:08:57,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 07:08:57,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236998389] [2022-04-15 07:08:57,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:08:57,593 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,593 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:08:57,593 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,612 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:57,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 07:08:57,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:57,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 07:08:57,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-15 07:08:57,613 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:57,986 INFO L93 Difference]: Finished difference Result 84 states and 110 transitions. [2022-04-15 07:08:57,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 07:08:57,986 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:08:57,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-15 07:08:57,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:57,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 110 transitions. [2022-04-15 07:08:57,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 110 transitions. [2022-04-15 07:08:58,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:08:58,060 INFO L225 Difference]: With dead ends: 84 [2022-04-15 07:08:58,060 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 07:08:58,061 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=273, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:08:58,061 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 148 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:08:58,061 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 31 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:08:58,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 07:08:58,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 33. [2022-04-15 07:08:58,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:08:58,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:58,067 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:58,067 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:58,069 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-04-15 07:08:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2022-04-15 07:08:58,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:58,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:58,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 07:08:58,069 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-15 07:08:58,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:08:58,070 INFO L93 Difference]: Finished difference Result 69 states and 89 transitions. [2022-04-15 07:08:58,070 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 89 transitions. [2022-04-15 07:08:58,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:08:58,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:08:58,070 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:08:58,070 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:08:58,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:08:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-04-15 07:08:58,071 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 30 [2022-04-15 07:08:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:08:58,071 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-04-15 07:08:58,072 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.25) internal successors, (27), 11 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:58,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 38 transitions. [2022-04-15 07:08:58,116 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:58,117 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-15 07:08:58,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 07:08:58,117 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:08:58,117 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:08:58,117 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-15 07:08:58,117 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:08:58,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:08:58,118 INFO L85 PathProgramCache]: Analyzing trace with hash 778127794, now seen corresponding path program 4 times [2022-04-15 07:08:58,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:08:58,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1285246226] [2022-04-15 07:09:02,233 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:02,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:09:02,322 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:04,249 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:04,285 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:06,445 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:06,481 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:08,548 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:08,602 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,639 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:12,711 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:12,767 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,946 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:12,947 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:12,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1832092587, now seen corresponding path program 1 times [2022-04-15 07:09:12,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:12,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910024660] [2022-04-15 07:09:12,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:12,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:12,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:12,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:12,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3042#true} is VALID [2022-04-15 07:09:12,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-15 07:09:12,973 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3042#true} {3042#true} #92#return; {3042#true} is VALID [2022-04-15 07:09:12,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {3042#true} call ULTIMATE.init(); {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:12,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {3048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3042#true} is VALID [2022-04-15 07:09:12,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {3042#true} assume true; {3042#true} is VALID [2022-04-15 07:09:12,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3042#true} {3042#true} #92#return; {3042#true} is VALID [2022-04-15 07:09:12,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {3042#true} call #t~ret10 := main(); {3042#true} is VALID [2022-04-15 07:09:12,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {3042#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3047#(= main_~a~0 0)} is VALID [2022-04-15 07:09:12,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {3047#(= main_~a~0 0)} [112] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_252| |v_main_#t~pre9_248|)) (.cse1 (= |v_main_#t~pre7_97| |v_main_#t~pre7_96|)) (.cse2 (= v_main_~d~0_144 v_main_~d~0_142)) (.cse3 (= |v_main_#t~pre8_169| |v_main_#t~pre8_168|)) (.cse4 (= v_main_~c~0_116 v_main_~c~0_114)) (.cse5 (= v_main_~b~0_79 v_main_~b~0_77)) (.cse6 (= |v_main_#t~pre6_78| |v_main_#t~pre6_77|)) (.cse7 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|)) (.cse8 (= v_main_~f~0_345 v_main_~f~0_340)) (.cse9 (= |v_main_#t~pre5_52| |v_main_#t~pre5_51|)) (.cse10 (= v_main_~e~0_233 v_main_~e~0_231))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~a~0_57 v_main_~a~0_58) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~a~0_58 v_main_~a~0_57) .cse10))) InVars {main_~e~0=v_main_~e~0_233, main_~d~0=v_main_~d~0_144, main_~b~0=v_main_~b~0_79, main_~f~0=v_main_~f~0_345, main_#t~pre7=|v_main_#t~pre7_97|, main_~c~0=v_main_~c~0_116, main_#t~pre8=|v_main_#t~pre8_169|, main_#t~pre9=|v_main_#t~pre9_252|, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_52|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_78|} OutVars{main_~e~0=v_main_~e~0_231, main_~d~0=v_main_~d~0_142, main_~b~0=v_main_~b~0_77, main_~f~0=v_main_~f~0_340, main_#t~pre7=|v_main_#t~pre7_96|, main_~c~0=v_main_~c~0_114, main_#t~pre8=|v_main_#t~pre8_168|, main_#t~pre9=|v_main_#t~pre9_248|, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_51|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_77|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3047#(= main_~a~0 0)} is VALID [2022-04-15 07:09:12,975 INFO L290 TraceCheckUtils]: 7: Hoare triple {3047#(= main_~a~0 0)} [111] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3043#false} is VALID [2022-04-15 07:09:12,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {3043#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3043#false} is VALID [2022-04-15 07:09:12,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {3043#false} assume !false; {3043#false} is VALID [2022-04-15 07:09:12,976 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,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:12,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910024660] [2022-04-15 07:09:12,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910024660] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:12,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:12,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:13,146 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:13,146 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1285246226] [2022-04-15 07:09:13,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1285246226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:13,146 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:13,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 07:09:13,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44740939] [2022-04-15 07:09:13,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:13,147 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,147 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:13,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,168 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:09:13,168 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 07:09:13,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:13,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 07:09:13,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:09:13,169 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,579 INFO L93 Difference]: Finished difference Result 86 states and 112 transitions. [2022-04-15 07:09:13,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 07:09:13,579 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:13,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-15 07:09:13,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 112 transitions. [2022-04-15 07:09:13,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 112 transitions. [2022-04-15 07:09:13,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:13,671 INFO L225 Difference]: With dead ends: 86 [2022-04-15 07:09:13,671 INFO L226 Difference]: Without dead ends: 71 [2022-04-15 07:09:13,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=168, Invalid=338, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:09:13,671 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 140 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:13,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 36 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:09:13,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-15 07:09:13,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 35. [2022-04-15 07:09:13,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:13,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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,681 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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,687 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,688 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-15 07:09:13,688 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-15 07:09:13,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:13,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:13,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 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:09:13,690 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 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:09:13,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:13,690 INFO L93 Difference]: Finished difference Result 71 states and 91 transitions. [2022-04-15 07:09:13,691 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2022-04-15 07:09:13,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:13,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:13,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:13,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:13,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call 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,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-04-15 07:09:13,691 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 32 [2022-04-15 07:09:13,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:13,692 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-04-15 07:09:13,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.230769230769231) internal successors, (29), 12 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:09:13,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 40 transitions. [2022-04-15 07:09:13,746 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:13,747 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-15 07:09:13,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 07:09:13,747 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:13,747 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:13,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-15 07:09:13,748 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:13,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:13,748 INFO L85 PathProgramCache]: Analyzing trace with hash 372310288, now seen corresponding path program 5 times [2022-04-15 07:09:13,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:13,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [106160169] [2022-04-15 07:09:17,850 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:17,892 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,932 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:21,988 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:22,044 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:22,077 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:26,141 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:26,179 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:26,217 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:30,284 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:30,336 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:30,371 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:34,432 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:34,479 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,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:34,605 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:34,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1832154091, now seen corresponding path program 1 times [2022-04-15 07:09:34,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:34,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455400273] [2022-04-15 07:09:34,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:34,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:34,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:34,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3464#true} is VALID [2022-04-15 07:09:34,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-15 07:09:34,631 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3464#true} {3464#true} #92#return; {3464#true} is VALID [2022-04-15 07:09:34,632 INFO L272 TraceCheckUtils]: 0: Hoare triple {3464#true} call ULTIMATE.init(); {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:34,632 INFO L290 TraceCheckUtils]: 1: Hoare triple {3470#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3464#true} is VALID [2022-04-15 07:09:34,632 INFO L290 TraceCheckUtils]: 2: Hoare triple {3464#true} assume true; {3464#true} is VALID [2022-04-15 07:09:34,632 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3464#true} {3464#true} #92#return; {3464#true} is VALID [2022-04-15 07:09:34,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {3464#true} call #t~ret10 := main(); {3464#true} is VALID [2022-04-15 07:09:34,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3464#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3469#(= main_~a~0 0)} is VALID [2022-04-15 07:09:34,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {3469#(= main_~a~0 0)} [114] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_126 v_main_~c~0_124)) (.cse1 (= |v_main_#t~pre7_105| |v_main_#t~pre7_104|)) (.cse2 (= v_main_~b~0_87 v_main_~b~0_85)) (.cse3 (= v_main_~d~0_156 v_main_~d~0_154)) (.cse4 (= |v_main_#t~pre5_58| |v_main_#t~pre5_57|)) (.cse5 (= v_main_~e~0_267 v_main_~e~0_265)) (.cse6 (= |v_main_#t~pre6_85| |v_main_#t~pre6_84|)) (.cse7 (= |v_main_#t~pre9_328| |v_main_#t~pre9_323|)) (.cse8 (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|)) (.cse9 (= v_main_~a~0_64 v_main_~a~0_63)) (.cse10 (= |v_main_#t~pre8_198| |v_main_#t~pre8_197|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~f~0_426 v_main_~f~0_432) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~f~0_432 v_main_~f~0_426) .cse10))) InVars {main_~e~0=v_main_~e~0_267, main_~d~0=v_main_~d~0_156, main_~b~0=v_main_~b~0_87, main_~f~0=v_main_~f~0_432, main_#t~pre7=|v_main_#t~pre7_105|, main_~c~0=v_main_~c~0_126, main_#t~pre8=|v_main_#t~pre8_198|, main_#t~pre9=|v_main_#t~pre9_328|, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_58|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_85|} OutVars{main_~e~0=v_main_~e~0_265, main_~d~0=v_main_~d~0_154, main_~b~0=v_main_~b~0_85, main_~f~0=v_main_~f~0_426, main_#t~pre7=|v_main_#t~pre7_104|, main_~c~0=v_main_~c~0_124, main_#t~pre8=|v_main_#t~pre8_197|, main_#t~pre9=|v_main_#t~pre9_323|, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_57|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_84|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3469#(= main_~a~0 0)} is VALID [2022-04-15 07:09:34,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {3469#(= main_~a~0 0)} [113] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3465#false} is VALID [2022-04-15 07:09:34,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {3465#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3465#false} is VALID [2022-04-15 07:09:34,634 INFO L290 TraceCheckUtils]: 9: Hoare triple {3465#false} assume !false; {3465#false} is VALID [2022-04-15 07:09:34,634 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:34,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:34,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455400273] [2022-04-15 07:09:34,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455400273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:34,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:34,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:34,810 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:34,811 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [106160169] [2022-04-15 07:09:34,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [106160169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:34,811 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:34,811 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 07:09:34,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654874094] [2022-04-15 07:09:34,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:34,811 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:34,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:34,811 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:34,829 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:09:34,829 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 07:09:34,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:34,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 07:09:34,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2022-04-15 07:09:34,835 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:35,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:35,292 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-04-15 07:09:35,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 07:09:35,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:35,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-04-15 07:09:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 114 transitions. [2022-04-15 07:09:35,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 114 transitions. [2022-04-15 07:09:35,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:35,386 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:09:35,387 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:09:35,387 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 21 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=189, Invalid=411, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:09:35,387 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 166 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:35,387 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [166 Valid, 26 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 07:09:35,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:09:35,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 37. [2022-04-15 07:09:35,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:35,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:35,397 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:35,397 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:35,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:35,401 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-15 07:09:35,401 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-15 07:09:35,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:35,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:35,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 07:09:35,401 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-15 07:09:35,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:35,402 INFO L93 Difference]: Finished difference Result 73 states and 93 transitions. [2022-04-15 07:09:35,402 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 93 transitions. [2022-04-15 07:09:35,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:35,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:35,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:35,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2022-04-15 07:09:35,403 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 34 [2022-04-15 07:09:35,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:35,403 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2022-04-15 07:09:35,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2142857142857144) internal successors, (31), 13 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:09:35,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 42 transitions. [2022-04-15 07:09:35,459 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:35,459 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-15 07:09:35,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-15 07:09:35,460 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:35,460 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:35,460 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-15 07:09:35,460 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:35,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:35,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1223710958, now seen corresponding path program 6 times [2022-04-15 07:09:35,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:35,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [659198521] [2022-04-15 07:09:35,638 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,826 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:38,891 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:38,995 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:43,080 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:43,138 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:43,241 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,882 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:45,939 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:46,047 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:50,125 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:50,194 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:50,278 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:50,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:50,439 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:50,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1832215595, now seen corresponding path program 1 times [2022-04-15 07:09:50,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:50,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281743212] [2022-04-15 07:09:50,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:50,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:50,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:50,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:50,483 INFO L290 TraceCheckUtils]: 0: Hoare triple {3907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3901#true} is VALID [2022-04-15 07:09:50,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {3901#true} assume true; {3901#true} is VALID [2022-04-15 07:09:50,484 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3901#true} {3901#true} #92#return; {3901#true} is VALID [2022-04-15 07:09:50,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {3901#true} call ULTIMATE.init(); {3907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:50,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {3907#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {3901#true} is VALID [2022-04-15 07:09:50,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {3901#true} assume true; {3901#true} is VALID [2022-04-15 07:09:50,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3901#true} {3901#true} #92#return; {3901#true} is VALID [2022-04-15 07:09:50,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {3901#true} call #t~ret10 := main(); {3901#true} is VALID [2022-04-15 07:09:50,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {3901#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {3906#(= main_~a~0 0)} is VALID [2022-04-15 07:09:50,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {3906#(= main_~a~0 0)} [116] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_64| |v_main_#t~pre5_63|)) (.cse1 (= |v_main_#t~pre8_227| |v_main_#t~pre8_226|)) (.cse2 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse3 (= v_main_~c~0_136 v_main_~c~0_134)) (.cse4 (= v_main_~f~0_525 v_main_~f~0_518)) (.cse5 (= |v_main_#t~pre6_92| |v_main_#t~pre6_91|)) (.cse6 (= |v_main_#t~pre9_409| |v_main_#t~pre9_403|)) (.cse7 (= v_main_~d~0_168 v_main_~d~0_166)) (.cse8 (= |v_main_#t~pre7_113| |v_main_#t~pre7_112|)) (.cse9 (= v_main_~e~0_301 v_main_~e~0_299)) (.cse10 (= v_main_~b~0_95 v_main_~b~0_93))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_~e~0=v_main_~e~0_301, main_~d~0=v_main_~d~0_168, main_~b~0=v_main_~b~0_95, main_~f~0=v_main_~f~0_525, main_#t~pre7=|v_main_#t~pre7_113|, main_~c~0=v_main_~c~0_136, main_#t~pre8=|v_main_#t~pre8_227|, main_#t~pre9=|v_main_#t~pre9_409|, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_64|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_92|} OutVars{main_~e~0=v_main_~e~0_299, main_~d~0=v_main_~d~0_166, main_~b~0=v_main_~b~0_93, main_~f~0=v_main_~f~0_518, main_#t~pre7=|v_main_#t~pre7_112|, main_~c~0=v_main_~c~0_134, main_#t~pre8=|v_main_#t~pre8_226|, main_#t~pre9=|v_main_#t~pre9_403|, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_63|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_91|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3906#(= main_~a~0 0)} is VALID [2022-04-15 07:09:50,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {3906#(= main_~a~0 0)} [115] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {3902#false} is VALID [2022-04-15 07:09:50,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {3902#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {3902#false} is VALID [2022-04-15 07:09:50,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {3902#false} assume !false; {3902#false} is VALID [2022-04-15 07:09:50,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:09:50,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:50,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281743212] [2022-04-15 07:09:50,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281743212] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:50,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:50,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:50,710 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:50,710 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [659198521] [2022-04-15 07:09:50,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [659198521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:50,710 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:50,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 07:09:50,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77254104] [2022-04-15 07:09:50,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:50,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:50,711 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:50,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:50,736 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:09:50,736 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 07:09:50,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:50,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 07:09:50,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-04-15 07:09:50,736 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:51,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:51,271 INFO L93 Difference]: Finished difference Result 88 states and 114 transitions. [2022-04-15 07:09:51,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 07:09:51,271 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:51,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:51,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-15 07:09:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 114 transitions. [2022-04-15 07:09:51,273 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 114 transitions. [2022-04-15 07:09:51,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:09:51,352 INFO L225 Difference]: With dead ends: 88 [2022-04-15 07:09:51,352 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 07:09:51,352 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 18 SyntacticMatches, 5 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=228, Invalid=584, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:09:51,370 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 153 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:51,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [153 Valid, 35 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:51,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 07:09:51,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 41. [2022-04-15 07:09:51,380 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:51,380 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:51,380 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:51,380 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:51,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:51,381 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 07:09:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 07:09:51,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:51,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:51,381 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 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:09:51,381 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 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:09:51,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:51,382 INFO L93 Difference]: Finished difference Result 73 states and 92 transitions. [2022-04-15 07:09:51,382 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 92 transitions. [2022-04-15 07:09:51,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:51,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:51,382 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:51,382 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:51,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.162162162162162) internal successors, (43), 37 states have internal predecessors, (43), 2 states have call successors, (2), 2 states have call 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:51,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-04-15 07:09:51,383 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 36 [2022-04-15 07:09:51,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:51,383 INFO L478 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-04-15 07:09:51,383 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 15 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:09:51,383 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 46 transitions. [2022-04-15 07:09:51,447 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:09:51,447 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-04-15 07:09:51,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 07:09:51,448 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:51,448 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:51,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-15 07:09:51,448 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:51,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -989686073, now seen corresponding path program 7 times [2022-04-15 07:09:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:51,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52559455] [2022-04-15 07:09:51,655 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,741 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:51,766 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:51,766 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:51,796 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:51,887 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,982 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:52,006 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:52,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:52,034 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:52,123 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:52,212 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:52,236 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:52,236 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:52,263 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:52,349 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:52,439 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:52,462 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:52,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:09:52,490 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:52,580 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:52,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:52,829 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:09:52,830 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:09:52,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1832277099, now seen corresponding path program 1 times [2022-04-15 07:09:52,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:09:52,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894012427] [2022-04-15 07:09:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:09:52,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:09:52,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:52,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:09:52,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:09:52,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {4358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4352#true} is VALID [2022-04-15 07:09:52,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {4352#true} assume true; {4352#true} is VALID [2022-04-15 07:09:52,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4352#true} {4352#true} #92#return; {4352#true} is VALID [2022-04-15 07:09:52,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {4352#true} call ULTIMATE.init(); {4358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:09:52,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {4358#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4352#true} is VALID [2022-04-15 07:09:52,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {4352#true} assume true; {4352#true} is VALID [2022-04-15 07:09:52,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4352#true} {4352#true} #92#return; {4352#true} is VALID [2022-04-15 07:09:52,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {4352#true} call #t~ret10 := main(); {4352#true} is VALID [2022-04-15 07:09:52,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {4352#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {4357#(= main_~a~0 0)} is VALID [2022-04-15 07:09:52,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {4357#(= main_~a~0 0)} [118] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_377 v_main_~e~0_374)) (.cse1 (= |v_main_#t~pre6_99| |v_main_#t~pre6_98|)) (.cse2 (= |v_main_#t~pre7_121| |v_main_#t~pre7_120|)) (.cse3 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse4 (= v_main_~c~0_146 v_main_~c~0_144)) (.cse5 (= |v_main_#t~pre9_474| |v_main_#t~pre9_468|)) (.cse6 (= v_main_~b~0_103 v_main_~b~0_101)) (.cse7 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|)) (.cse8 (= |v_main_#t~pre8_291| |v_main_#t~pre8_289|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_178 v_main_~d~0_180) .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_69| |v_main_#t~pre5_70|) (= v_main_~f~0_647 v_main_~f~0_655)) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~d~0_180 v_main_~d~0_178) .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre5_70| |v_main_#t~pre5_69|) .cse8 (= v_main_~f~0_655 v_main_~f~0_647)))) InVars {main_~e~0=v_main_~e~0_377, main_~d~0=v_main_~d~0_180, main_~b~0=v_main_~b~0_103, main_~f~0=v_main_~f~0_655, main_#t~pre7=|v_main_#t~pre7_121|, main_~c~0=v_main_~c~0_146, main_#t~pre8=|v_main_#t~pre8_291|, main_#t~pre9=|v_main_#t~pre9_474|, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_70|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_99|} OutVars{main_~e~0=v_main_~e~0_374, main_~d~0=v_main_~d~0_178, main_~b~0=v_main_~b~0_101, main_~f~0=v_main_~f~0_647, main_#t~pre7=|v_main_#t~pre7_120|, main_~c~0=v_main_~c~0_144, main_#t~pre8=|v_main_#t~pre8_289|, main_#t~pre9=|v_main_#t~pre9_468|, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_69|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_98|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4357#(= main_~a~0 0)} is VALID [2022-04-15 07:09:52,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {4357#(= main_~a~0 0)} [117] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4353#false} is VALID [2022-04-15 07:09:52,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {4353#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {4353#false} is VALID [2022-04-15 07:09:52,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {4353#false} assume !false; {4353#false} is VALID [2022-04-15 07:09:52,871 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:52,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:09:52,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894012427] [2022-04-15 07:09:52,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894012427] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:52,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:52,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:09:53,147 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:09:53,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52559455] [2022-04-15 07:09:53,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52559455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:09:53,148 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:09:53,148 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 07:09:53,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [696795576] [2022-04-15 07:09:53,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:09:53,148 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 07:09:53,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:09:53,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:53,173 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:09:53,173 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 07:09:53,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:53,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 07:09:53,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-04-15 07:09:53,174 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:53,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:53,734 INFO L93 Difference]: Finished difference Result 90 states and 115 transitions. [2022-04-15 07:09:53,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 07:09:53,735 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 39 [2022-04-15 07:09:53,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:09:53,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-15 07:09:53,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:53,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 115 transitions. [2022-04-15 07:09:53,736 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 115 transitions. [2022-04-15 07:09:53,794 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:09:53,795 INFO L225 Difference]: With dead ends: 90 [2022-04-15 07:09:53,795 INFO L226 Difference]: Without dead ends: 75 [2022-04-15 07:09:53,795 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=246, Invalid=684, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:09:53,796 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 286 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:09:53,796 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 35 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 286 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:09:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-15 07:09:53,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 42. [2022-04-15 07:09:53,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:09:53,805 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:53,806 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:53,806 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:53,806 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-15 07:09:53,807 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-04-15 07:09:53,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:53,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:53,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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 75 states. [2022-04-15 07:09:53,807 INFO L87 Difference]: Start difference. First operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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 75 states. [2022-04-15 07:09:53,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:09:53,808 INFO L93 Difference]: Finished difference Result 75 states and 94 transitions. [2022-04-15 07:09:53,808 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2022-04-15 07:09:53,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:09:53,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:09:53,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:09:53,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:09:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 38 states have (on average 1.1578947368421053) internal successors, (44), 38 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:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-04-15 07:09:53,809 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 39 [2022-04-15 07:09:53,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:09:53,809 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-04-15 07:09:53,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 16 states have internal predecessors, (36), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:09:53,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 47 transitions. [2022-04-15 07:09:53,863 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:53,863 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-04-15 07:09:53,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 07:09:53,864 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:09:53,864 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:09:53,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-15 07:09:53,864 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:09:53,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:09:53,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1984733979, now seen corresponding path program 8 times [2022-04-15 07:09:53,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:09:53,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [446472222] [2022-04-15 07:09:54,054 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:54,155 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:56,406 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:09:56,487 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:56,521 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:56,629 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:56,713 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:58,863 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:58,889 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:58,990 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:59,078 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:03,173 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:03,222 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:03,259 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:03,337 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:03,434 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:07,524 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:07,571 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:07,613 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:07,710 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:07,791 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:07,947 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:07,948 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:07,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1832338603, now seen corresponding path program 1 times [2022-04-15 07:10:07,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:07,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426546271] [2022-04-15 07:10:07,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:07,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:07,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:07,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:07,975 INFO L290 TraceCheckUtils]: 0: Hoare triple {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4816#true} is VALID [2022-04-15 07:10:07,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {4816#true} assume true; {4816#true} is VALID [2022-04-15 07:10:07,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4816#true} {4816#true} #92#return; {4816#true} is VALID [2022-04-15 07:10:07,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {4816#true} call ULTIMATE.init(); {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:07,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {4822#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {4816#true} is VALID [2022-04-15 07:10:07,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {4816#true} assume true; {4816#true} is VALID [2022-04-15 07:10:07,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4816#true} {4816#true} #92#return; {4816#true} is VALID [2022-04-15 07:10:07,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {4816#true} call #t~ret10 := main(); {4816#true} is VALID [2022-04-15 07:10:07,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {4816#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {4821#(= main_~a~0 0)} is VALID [2022-04-15 07:10:07,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {4821#(= main_~a~0 0)} [120] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_76| |v_main_#t~pre5_75|)) (.cse1 (= |v_main_#t~pre8_372| |v_main_#t~pre8_370|)) (.cse2 (= |v_main_#t~pre7_129| |v_main_#t~pre7_128|)) (.cse3 (= |v_main_#t~pre6_106| |v_main_#t~pre6_105|)) (.cse4 (= v_main_~a~0_82 v_main_~a~0_81)) (.cse5 (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|)) (.cse6 (= v_main_~e~0_467 v_main_~e~0_464)) (.cse7 (= v_main_~c~0_156 v_main_~c~0_154))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_111 v_main_~b~0_109) (= v_main_~d~0_192 v_main_~d~0_190) .cse4 (= |v_main_#t~pre9_581| |v_main_#t~pre9_574|) .cse5 .cse6 (= v_main_~f~0_810 v_main_~f~0_801) .cse7) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_574| |v_main_#t~pre9_581|) (= v_main_~f~0_801 v_main_~f~0_810) (= v_main_~d~0_190 v_main_~d~0_192) .cse4 .cse5 .cse6 .cse7 (= v_main_~b~0_109 v_main_~b~0_111)))) InVars {main_~e~0=v_main_~e~0_467, main_~d~0=v_main_~d~0_192, main_~b~0=v_main_~b~0_111, main_~f~0=v_main_~f~0_810, main_#t~pre7=|v_main_#t~pre7_129|, main_~c~0=v_main_~c~0_156, main_#t~pre8=|v_main_#t~pre8_372|, main_#t~pre9=|v_main_#t~pre9_581|, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_76|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_106|} OutVars{main_~e~0=v_main_~e~0_464, main_~d~0=v_main_~d~0_190, main_~b~0=v_main_~b~0_109, main_~f~0=v_main_~f~0_801, main_#t~pre7=|v_main_#t~pre7_128|, main_~c~0=v_main_~c~0_154, main_#t~pre8=|v_main_#t~pre8_370|, main_#t~pre9=|v_main_#t~pre9_574|, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_75|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_105|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4821#(= main_~a~0 0)} is VALID [2022-04-15 07:10:07,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {4821#(= main_~a~0 0)} [119] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {4817#false} is VALID [2022-04-15 07:10:07,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {4817#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {4817#false} is VALID [2022-04-15 07:10:07,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {4817#false} assume !false; {4817#false} is VALID [2022-04-15 07:10:07,978 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:07,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:07,978 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426546271] [2022-04-15 07:10:07,978 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426546271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:07,978 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:07,978 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:08,231 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:08,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [446472222] [2022-04-15 07:10:08,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [446472222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:08,232 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:08,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 07:10:08,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2095647356] [2022-04-15 07:10:08,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:08,232 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2022-04-15 07:10:08,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:08,233 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:08,251 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:10:08,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 07:10:08,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:08,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 07:10:08,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-04-15 07:10:08,252 INFO L87 Difference]: Start difference. First operand 42 states and 47 transitions. Second operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:08,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:08,816 INFO L93 Difference]: Finished difference Result 92 states and 117 transitions. [2022-04-15 07:10:08,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 07:10:08,816 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 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 41 [2022-04-15 07:10:08,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:08,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:08,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-15 07:10:08,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:08,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 117 transitions. [2022-04-15 07:10:08,819 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 117 transitions. [2022-04-15 07:10:08,883 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:10:08,885 INFO L225 Difference]: With dead ends: 92 [2022-04-15 07:10:08,885 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 07:10:08,886 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=264, Invalid=792, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:10:08,886 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 143 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:08,887 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 50 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:10:08,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 07:10:08,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 44. [2022-04-15 07:10:08,897 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:08,898 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:10:08,898 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:10:08,898 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:10:08,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:08,899 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-15 07:10:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-15 07:10:08,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:08,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:08,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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 77 states. [2022-04-15 07:10:08,903 INFO L87 Difference]: Start difference. First operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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 77 states. [2022-04-15 07:10:08,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:08,905 INFO L93 Difference]: Finished difference Result 77 states and 96 transitions. [2022-04-15 07:10:08,905 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 96 transitions. [2022-04-15 07:10:08,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:08,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:08,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:08,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:08,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.15) internal successors, (46), 40 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:10:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-04-15 07:10:08,907 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 41 [2022-04-15 07:10:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:08,907 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-04-15 07:10:08,907 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.111111111111111) internal successors, (38), 17 states have internal predecessors, (38), 1 states have call successors, (2), 2 states have call 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:08,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 49 transitions. [2022-04-15 07:10:08,969 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:10:08,970 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-04-15 07:10:08,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 07:10:08,971 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:08,971 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:08,971 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-15 07:10:08,971 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:08,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:08,972 INFO L85 PathProgramCache]: Analyzing trace with hash -448064637, now seen corresponding path program 9 times [2022-04-15 07:10:08,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:08,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [125405076] [2022-04-15 07:10:10,013 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:10,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:10,105 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:10,105 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:10,125 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:12,177 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:12,205 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:12,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:12,277 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:12,277 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:12,307 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:14,377 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:14,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:14,495 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:14,516 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:14,516 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:14,550 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:14,716 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:14,810 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:14,836 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:14,836 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:14,869 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:15,059 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:15,148 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:15,321 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:15,321 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:15,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1832400107, now seen corresponding path program 1 times [2022-04-15 07:10:15,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:15,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68538024] [2022-04-15 07:10:15,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:15,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:15,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:15,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {5301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5295#true} is VALID [2022-04-15 07:10:15,347 INFO L290 TraceCheckUtils]: 1: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-15 07:10:15,347 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5295#true} {5295#true} #92#return; {5295#true} is VALID [2022-04-15 07:10:15,347 INFO L272 TraceCheckUtils]: 0: Hoare triple {5295#true} call ULTIMATE.init(); {5301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:15,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {5301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5295#true} is VALID [2022-04-15 07:10:15,348 INFO L290 TraceCheckUtils]: 2: Hoare triple {5295#true} assume true; {5295#true} is VALID [2022-04-15 07:10:15,348 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5295#true} {5295#true} #92#return; {5295#true} is VALID [2022-04-15 07:10:15,348 INFO L272 TraceCheckUtils]: 4: Hoare triple {5295#true} call #t~ret10 := main(); {5295#true} is VALID [2022-04-15 07:10:15,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {5295#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {5300#(= main_~a~0 0)} is VALID [2022-04-15 07:10:15,349 INFO L290 TraceCheckUtils]: 6: Hoare triple {5300#(= main_~a~0 0)} [122] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_166 v_main_~c~0_164)) (.cse1 (= |v_main_#t~pre7_137| |v_main_#t~pre7_136|)) (.cse2 (= |v_main_#t~pre8_437| |v_main_#t~pre8_435|)) (.cse3 (= v_main_~e~0_545 v_main_~e~0_542)) (.cse4 (= |v_main_#t~pre6_113| |v_main_#t~pre6_112|)) (.cse5 (= |v_main_#t~pre5_82| |v_main_#t~pre5_81|)) (.cse6 (= v_main_~a~0_88 v_main_~a~0_87)) (.cse7 (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|)) (.cse8 (= v_main_~b~0_119 v_main_~b~0_117)) (.cse9 (= v_main_~d~0_204 v_main_~d~0_202))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_677| |v_main_#t~pre9_669|) .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~f~0_955 v_main_~f~0_945) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre9_669| |v_main_#t~pre9_677|) .cse8 .cse9 (= v_main_~f~0_945 v_main_~f~0_955)))) InVars {main_~e~0=v_main_~e~0_545, main_~d~0=v_main_~d~0_204, main_~b~0=v_main_~b~0_119, main_~f~0=v_main_~f~0_955, main_#t~pre7=|v_main_#t~pre7_137|, main_~c~0=v_main_~c~0_166, main_#t~pre8=|v_main_#t~pre8_437|, main_#t~pre9=|v_main_#t~pre9_677|, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_82|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_113|} OutVars{main_~e~0=v_main_~e~0_542, main_~d~0=v_main_~d~0_202, main_~b~0=v_main_~b~0_117, main_~f~0=v_main_~f~0_945, main_#t~pre7=|v_main_#t~pre7_136|, main_~c~0=v_main_~c~0_164, main_#t~pre8=|v_main_#t~pre8_435|, main_#t~pre9=|v_main_#t~pre9_669|, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_81|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_112|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5300#(= main_~a~0 0)} is VALID [2022-04-15 07:10:15,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {5300#(= main_~a~0 0)} [121] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5296#false} is VALID [2022-04-15 07:10:15,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {5296#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {5296#false} is VALID [2022-04-15 07:10:15,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {5296#false} assume !false; {5296#false} is VALID [2022-04-15 07:10:15,349 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:15,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:15,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68538024] [2022-04-15 07:10:15,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68538024] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:15,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:15,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:15,708 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:15,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [125405076] [2022-04-15 07:10:15,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [125405076] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:15,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:15,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 07:10:15,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [257866805] [2022-04-15 07:10:15,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:15,709 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2022-04-15 07:10:15,709 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:15,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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:15,739 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:10:15,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 07:10:15,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:15,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 07:10:15,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=246, Unknown=0, NotChecked=0, Total=342 [2022-04-15 07:10:15,739 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,486 INFO L93 Difference]: Finished difference Result 94 states and 119 transitions. [2022-04-15 07:10:16,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 07:10:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 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 43 [2022-04-15 07:10:16,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:16,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2022-04-15 07:10:16,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 119 transitions. [2022-04-15 07:10:16,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 119 transitions. [2022-04-15 07:10:16,582 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:10:16,583 INFO L225 Difference]: With dead ends: 94 [2022-04-15 07:10:16,583 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 07:10:16,583 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=908, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:10:16,584 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 170 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:16,584 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [170 Valid, 40 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:10:16,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 07:10:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 46. [2022-04-15 07:10:16,597 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:16,597 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call 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,598 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call 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,598 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call 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,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,599 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-15 07:10:16,599 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-15 07:10:16,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:16,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:16,599 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 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 79 states. [2022-04-15 07:10:16,599 INFO L87 Difference]: Start difference. First operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 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 79 states. [2022-04-15 07:10:16,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:16,600 INFO L93 Difference]: Finished difference Result 79 states and 98 transitions. [2022-04-15 07:10:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2022-04-15 07:10:16,600 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:16,600 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:16,600 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:16,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:16,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 42 states have (on average 1.1428571428571428) internal successors, (48), 42 states have internal predecessors, (48), 2 states have call successors, (2), 2 states have call 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,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-04-15 07:10:16,601 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 43 [2022-04-15 07:10:16,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:16,601 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-04-15 07:10:16,601 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 18 states have internal predecessors, (40), 1 states have call successors, (2), 2 states have call 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,601 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 51 transitions. [2022-04-15 07:10:16,678 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:10:16,679 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-04-15 07:10:16,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 07:10:16,679 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:16,679 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:16,679 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-15 07:10:16,680 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:16,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:16,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1177576799, now seen corresponding path program 10 times [2022-04-15 07:10:16,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:16,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1280015892] [2022-04-15 07:10:16,934 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:17,020 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:17,045 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:17,045 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:17,078 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:17,188 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:17,260 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:17,293 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:17,293 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:17,326 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:17,436 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:17,525 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:17,551 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:17,551 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:17,585 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:17,693 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:17,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:10:17,807 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:17,808 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:17,841 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:17,962 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:18,021 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:18,134 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:18,134 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:18,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1832461611, now seen corresponding path program 1 times [2022-04-15 07:10:18,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:18,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1659981748] [2022-04-15 07:10:18,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:18,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:18,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:18,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:18,163 INFO L290 TraceCheckUtils]: 0: Hoare triple {5795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5789#true} is VALID [2022-04-15 07:10:18,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-15 07:10:18,163 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5789#true} {5789#true} #92#return; {5789#true} is VALID [2022-04-15 07:10:18,164 INFO L272 TraceCheckUtils]: 0: Hoare triple {5789#true} call ULTIMATE.init(); {5795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:18,164 INFO L290 TraceCheckUtils]: 1: Hoare triple {5795#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {5789#true} is VALID [2022-04-15 07:10:18,164 INFO L290 TraceCheckUtils]: 2: Hoare triple {5789#true} assume true; {5789#true} is VALID [2022-04-15 07:10:18,164 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5789#true} {5789#true} #92#return; {5789#true} is VALID [2022-04-15 07:10:18,164 INFO L272 TraceCheckUtils]: 4: Hoare triple {5789#true} call #t~ret10 := main(); {5789#true} is VALID [2022-04-15 07:10:18,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {5789#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {5794#(= main_~a~0 0)} is VALID [2022-04-15 07:10:18,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {5794#(= main_~a~0 0)} [124] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre8_502| |v_main_#t~pre8_500|)) (.cse2 (= v_main_~e~0_623 v_main_~e~0_620)) (.cse3 (= v_main_~c~0_176 v_main_~c~0_174)) (.cse4 (= v_main_~b~0_127 v_main_~b~0_125)) (.cse5 (= v_main_~d~0_216 v_main_~d~0_214)) (.cse6 (= |v_main_#t~pre5_88| |v_main_#t~pre5_87|)) (.cse7 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse8 (= v_main_~f~0_1106 v_main_~f~0_1095)) (.cse9 (= |v_main_#t~pre7_145| |v_main_#t~pre7_144|))) (or (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_119| |v_main_#t~pre6_120|) .cse4 .cse5 .cse6 (= |v_main_#t~pre9_769| |v_main_#t~pre9_778|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_120| |v_main_#t~pre6_119|) .cse4 .cse5 (= |v_main_#t~pre9_778| |v_main_#t~pre9_769|) .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_623, main_~d~0=v_main_~d~0_216, main_~b~0=v_main_~b~0_127, main_~f~0=v_main_~f~0_1106, main_#t~pre7=|v_main_#t~pre7_145|, main_~c~0=v_main_~c~0_176, main_#t~pre8=|v_main_#t~pre8_502|, main_#t~pre9=|v_main_#t~pre9_778|, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_88|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_120|} OutVars{main_~e~0=v_main_~e~0_620, main_~d~0=v_main_~d~0_214, main_~b~0=v_main_~b~0_125, main_~f~0=v_main_~f~0_1095, main_#t~pre7=|v_main_#t~pre7_144|, main_~c~0=v_main_~c~0_174, main_#t~pre8=|v_main_#t~pre8_500|, main_#t~pre9=|v_main_#t~pre9_769|, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_87|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_119|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5794#(= main_~a~0 0)} is VALID [2022-04-15 07:10:18,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {5794#(= main_~a~0 0)} [123] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {5790#false} is VALID [2022-04-15 07:10:18,165 INFO L290 TraceCheckUtils]: 8: Hoare triple {5790#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {5790#false} is VALID [2022-04-15 07:10:18,165 INFO L290 TraceCheckUtils]: 9: Hoare triple {5790#false} assume !false; {5790#false} is VALID [2022-04-15 07:10:18,165 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:18,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:18,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1659981748] [2022-04-15 07:10:18,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1659981748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:18,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:18,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:18,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:18,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1280015892] [2022-04-15 07:10:18,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1280015892] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:18,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:18,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 07:10:18,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332061878] [2022-04-15 07:10:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:18,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:18,420 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:18,440 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:10:18,440 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 07:10:18,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:18,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 07:10:18,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=278, Unknown=0, NotChecked=0, Total=380 [2022-04-15 07:10:18,441 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:19,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,093 INFO L93 Difference]: Finished difference Result 96 states and 121 transitions. [2022-04-15 07:10:19,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 07:10:19,093 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:19,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:19,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-04-15 07:10:19,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:19,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 121 transitions. [2022-04-15 07:10:19,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 121 transitions. [2022-04-15 07:10:19,160 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:10:19,160 INFO L225 Difference]: With dead ends: 96 [2022-04-15 07:10:19,161 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 07:10:19,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=1032, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:10:19,162 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 204 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:19,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [204 Valid, 25 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 07:10:19,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 07:10:19,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 48. [2022-04-15 07:10:19,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:19,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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,181 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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,181 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,183 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 07:10:19,183 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 07:10:19,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:19,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:19,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 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:19,184 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 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:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:19,185 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-15 07:10:19,185 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-15 07:10:19,185 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:19,185 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:19,185 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:19,185 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.1363636363636365) internal successors, (50), 44 states have internal predecessors, (50), 2 states have call successors, (2), 2 states have call 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 L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 53 transitions. [2022-04-15 07:10:19,186 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 53 transitions. Word has length 45 [2022-04-15 07:10:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:19,186 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 53 transitions. [2022-04-15 07:10:19,186 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 19 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:10:19,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 53 transitions. [2022-04-15 07:10:19,252 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:10:19,252 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 53 transitions. [2022-04-15 07:10:19,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 07:10:19,252 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:19,252 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:19,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-15 07:10:19,253 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:19,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:19,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2135872063, now seen corresponding path program 11 times [2022-04-15 07:10:19,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:19,264 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1711570064] [2022-04-15 07:10:19,528 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,627 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,663 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,663 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:19,688 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,758 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,816 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,846 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,847 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:19,867 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,933 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,990 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:20,006 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:20,006 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:20,026 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:20,095 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:20,169 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:20,185 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:20,185 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:20,206 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:20,283 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:20,357 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:20,460 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:20,460 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:20,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1832523115, now seen corresponding path program 1 times [2022-04-15 07:10:20,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:20,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978324911] [2022-04-15 07:10:20,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:20,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:20,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:20,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:20,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6298#true} is VALID [2022-04-15 07:10:20,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {6298#true} assume true; {6298#true} is VALID [2022-04-15 07:10:20,497 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6298#true} {6298#true} #92#return; {6298#true} is VALID [2022-04-15 07:10:20,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {6298#true} call ULTIMATE.init(); {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:20,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {6304#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6298#true} is VALID [2022-04-15 07:10:20,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {6298#true} assume true; {6298#true} is VALID [2022-04-15 07:10:20,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6298#true} {6298#true} #92#return; {6298#true} is VALID [2022-04-15 07:10:20,498 INFO L272 TraceCheckUtils]: 4: Hoare triple {6298#true} call #t~ret10 := main(); {6298#true} is VALID [2022-04-15 07:10:20,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {6298#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {6303#(= main_~a~0 0)} is VALID [2022-04-15 07:10:20,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {6303#(= main_~a~0 0)} [126] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_228 v_main_~d~0_226)) (.cse1 (= |v_main_#t~pre5_94| |v_main_#t~pre5_93|)) (.cse2 (= |v_main_#t~pre6_127| |v_main_#t~pre6_126|)) (.cse3 (= v_main_~f~0_1263 v_main_~f~0_1251)) (.cse4 (= |v_main_#t~pre8_567| |v_main_#t~pre8_565|)) (.cse5 (= v_main_~e~0_701 v_main_~e~0_698)) (.cse6 (= |v_main_#t~pre7_153| |v_main_#t~pre7_152|)) (.cse7 (= v_main_~a~0_100 v_main_~a~0_99)) (.cse8 (= v_main_~b~0_135 v_main_~b~0_133)) (.cse9 (= v_main_~c~0_186 v_main_~c~0_184))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_884| |v_main_#t~pre9_874|) .cse5 .cse6 .cse7 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre9_874| |v_main_#t~pre9_884|) .cse4 .cse5 .cse6 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_701, main_~d~0=v_main_~d~0_228, main_~b~0=v_main_~b~0_135, main_~f~0=v_main_~f~0_1263, main_#t~pre7=|v_main_#t~pre7_153|, main_~c~0=v_main_~c~0_186, main_#t~pre8=|v_main_#t~pre8_567|, main_#t~pre9=|v_main_#t~pre9_884|, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_94|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_127|} OutVars{main_~e~0=v_main_~e~0_698, main_~d~0=v_main_~d~0_226, main_~b~0=v_main_~b~0_133, main_~f~0=v_main_~f~0_1251, main_#t~pre7=|v_main_#t~pre7_152|, main_~c~0=v_main_~c~0_184, main_#t~pre8=|v_main_#t~pre8_565|, main_#t~pre9=|v_main_#t~pre9_874|, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_93|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_126|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6303#(= main_~a~0 0)} is VALID [2022-04-15 07:10:20,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {6303#(= main_~a~0 0)} [125] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6299#false} is VALID [2022-04-15 07:10:20,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {6299#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {6299#false} is VALID [2022-04-15 07:10:20,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {6299#false} assume !false; {6299#false} is VALID [2022-04-15 07:10:20,499 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:20,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:20,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978324911] [2022-04-15 07:10:20,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978324911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:20,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:20,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:20,927 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:20,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1711570064] [2022-04-15 07:10:20,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1711570064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:20,927 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:20,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 07:10:20,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781915769] [2022-04-15 07:10:20,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:20,927 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:20,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:20,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:20,959 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:10:20,959 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 07:10:20,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:20,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 07:10:20,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=312, Unknown=0, NotChecked=0, Total=420 [2022-04-15 07:10:20,960 INFO L87 Difference]: Start difference. First operand 48 states and 53 transitions. Second operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:21,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,818 INFO L93 Difference]: Finished difference Result 98 states and 123 transitions. [2022-04-15 07:10:21,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 07:10:21,818 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:21,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:21,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:21,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 123 transitions. [2022-04-15 07:10:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:21,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 123 transitions. [2022-04-15 07:10:21,821 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 123 transitions. [2022-04-15 07:10:21,915 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:10:21,916 INFO L225 Difference]: With dead ends: 98 [2022-04-15 07:10:21,916 INFO L226 Difference]: Without dead ends: 83 [2022-04-15 07:10:21,918 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 241 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=318, Invalid=1164, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:10:21,918 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 181 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 522 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:21,919 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [181 Valid, 30 Invalid, 522 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:10:21,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-15 07:10:21,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 50. [2022-04-15 07:10:21,940 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:21,940 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call 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:21,940 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call 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:21,940 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call 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:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,941 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-15 07:10:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-15 07:10:21,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:21,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:21,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 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 83 states. [2022-04-15 07:10:21,942 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 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 83 states. [2022-04-15 07:10:21,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:21,943 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-15 07:10:21,943 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 102 transitions. [2022-04-15 07:10:21,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:21,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:21,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:21,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:21,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.1304347826086956) internal successors, (52), 46 states have internal predecessors, (52), 2 states have call successors, (2), 2 states have call 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:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 55 transitions. [2022-04-15 07:10:21,947 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 55 transitions. Word has length 47 [2022-04-15 07:10:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:21,947 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 55 transitions. [2022-04-15 07:10:21,947 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 20 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:10:21,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 55 transitions. [2022-04-15 07:10:22,028 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:22,029 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 55 transitions. [2022-04-15 07:10:22,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 07:10:22,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:22,029 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:22,029 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-15 07:10:22,029 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:22,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:22,029 INFO L85 PathProgramCache]: Analyzing trace with hash -505505187, now seen corresponding path program 12 times [2022-04-15 07:10:22,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:22,030 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1878402680] [2022-04-15 07:10:26,296 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:26,341 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,429 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,454 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,455 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:26,487 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:30,551 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:30,594 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:30,683 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:30,708 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:30,708 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:30,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:10:33,910 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:33,955 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:34,047 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:34,071 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:34,071 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:34,103 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:37,489 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:37,580 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:37,604 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:37,604 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:37,637 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:41,702 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:41,765 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:41,852 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:42,013 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:42,014 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:42,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1832584619, now seen corresponding path program 1 times [2022-04-15 07:10:42,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:42,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095338114] [2022-04-15 07:10:42,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:42,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:42,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:42,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:42,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {6828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6822#true} is VALID [2022-04-15 07:10:42,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {6822#true} assume true; {6822#true} is VALID [2022-04-15 07:10:42,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6822#true} {6822#true} #92#return; {6822#true} is VALID [2022-04-15 07:10:42,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {6822#true} call ULTIMATE.init(); {6828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:42,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {6828#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {6822#true} is VALID [2022-04-15 07:10:42,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {6822#true} assume true; {6822#true} is VALID [2022-04-15 07:10:42,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6822#true} {6822#true} #92#return; {6822#true} is VALID [2022-04-15 07:10:42,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {6822#true} call #t~ret10 := main(); {6822#true} is VALID [2022-04-15 07:10:42,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {6822#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {6827#(= main_~a~0 0)} is VALID [2022-04-15 07:10:42,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {6827#(= main_~a~0 0)} [128] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre8_632| |v_main_#t~pre8_630|)) (.cse1 (= |v_main_#t~pre6_134| |v_main_#t~pre6_133|)) (.cse2 (= |v_main_#t~pre9_995| |v_main_#t~pre9_984|)) (.cse3 (= v_main_~b~0_143 v_main_~b~0_141)) (.cse4 (= v_main_~d~0_240 v_main_~d~0_238)) (.cse5 (= v_main_~a~0_106 v_main_~a~0_105)) (.cse6 (= v_main_~c~0_196 v_main_~c~0_194)) (.cse7 (= |v_main_#t~pre7_161| |v_main_#t~pre7_160|)) (.cse8 (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|)) (.cse9 (= v_main_~f~0_1426 v_main_~f~0_1413))) (or (and .cse0 .cse1 .cse2 (= v_main_~e~0_776 v_main_~e~0_779) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_99| |v_main_#t~pre5_100|) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_100| |v_main_#t~pre5_99|) .cse5 .cse6 (= v_main_~e~0_779 v_main_~e~0_776) .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_779, main_~d~0=v_main_~d~0_240, main_~b~0=v_main_~b~0_143, main_~f~0=v_main_~f~0_1426, main_#t~pre7=|v_main_#t~pre7_161|, main_~c~0=v_main_~c~0_196, main_#t~pre8=|v_main_#t~pre8_632|, main_#t~pre9=|v_main_#t~pre9_995|, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_100|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_134|} OutVars{main_~e~0=v_main_~e~0_776, main_~d~0=v_main_~d~0_238, main_~b~0=v_main_~b~0_141, main_~f~0=v_main_~f~0_1413, main_#t~pre7=|v_main_#t~pre7_160|, main_~c~0=v_main_~c~0_194, main_#t~pre8=|v_main_#t~pre8_630|, main_#t~pre9=|v_main_#t~pre9_984|, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_99|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_133|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6827#(= main_~a~0 0)} is VALID [2022-04-15 07:10:42,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {6827#(= main_~a~0 0)} [127] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {6823#false} is VALID [2022-04-15 07:10:42,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {6823#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {6823#false} is VALID [2022-04-15 07:10:42,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {6823#false} assume !false; {6823#false} is VALID [2022-04-15 07:10:42,048 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:42,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:42,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095338114] [2022-04-15 07:10:42,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095338114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:42,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:42,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:42,451 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:42,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1878402680] [2022-04-15 07:10:42,451 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1878402680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:42,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:42,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 07:10:42,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386533898] [2022-04-15 07:10:42,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:42,452 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:42,452 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:42,452 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:42,473 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:10:42,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 07:10:42,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:42,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 07:10:42,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=348, Unknown=0, NotChecked=0, Total=462 [2022-04-15 07:10:42,473 INFO L87 Difference]: Start difference. First operand 50 states and 55 transitions. Second operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:43,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:43,310 INFO L93 Difference]: Finished difference Result 102 states and 128 transitions. [2022-04-15 07:10:43,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 07:10:43,310 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:43,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:43,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-15 07:10:43,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:43,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 128 transitions. [2022-04-15 07:10:43,318 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 128 transitions. [2022-04-15 07:10:43,404 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:10:43,405 INFO L225 Difference]: With dead ends: 102 [2022-04-15 07:10:43,405 INFO L226 Difference]: Without dead ends: 87 [2022-04-15 07:10:43,405 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=336, Invalid=1304, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:10:43,406 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 163 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:43,406 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 30 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 07:10:43,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-15 07:10:43,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 54. [2022-04-15 07:10:43,422 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:43,422 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:43,422 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:43,422 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:43,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:43,423 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-15 07:10:43,423 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-04-15 07:10:43,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:43,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:43,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 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 87 states. [2022-04-15 07:10:43,424 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 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 87 states. [2022-04-15 07:10:43,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:43,424 INFO L93 Difference]: Finished difference Result 87 states and 106 transitions. [2022-04-15 07:10:43,424 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 106 transitions. [2022-04-15 07:10:43,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:43,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:43,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:43,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:43,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.12) internal successors, (56), 50 states have internal predecessors, (56), 2 states have call successors, (2), 2 states have call 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:43,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 59 transitions. [2022-04-15 07:10:43,425 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 59 transitions. Word has length 49 [2022-04-15 07:10:43,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:43,426 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 59 transitions. [2022-04-15 07:10:43,426 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.090909090909091) internal successors, (46), 21 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:10:43,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 59 transitions. [2022-04-15 07:10:43,521 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:10:43,521 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 59 transitions. [2022-04-15 07:10:43,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 07:10:43,521 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:43,521 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:43,521 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-15 07:10:43,521 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:43,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:43,522 INFO L85 PathProgramCache]: Analyzing trace with hash -543370501, now seen corresponding path program 13 times [2022-04-15 07:10:43,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:43,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [805196659] [2022-04-15 07:10:43,740 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,831 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:43,859 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:43,859 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:43,957 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:44,050 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:44,074 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:44,074 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:44,175 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:44,265 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:44,292 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:44,292 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:44,367 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:44,465 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:44,488 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:44,488 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:10:44,586 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:44,689 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:44,835 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:10:44,836 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:10:44,836 INFO L85 PathProgramCache]: Analyzing trace with hash 1832646123, now seen corresponding path program 1 times [2022-04-15 07:10:44,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:10:44,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669996842] [2022-04-15 07:10:44,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:10:44,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:10:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:44,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:10:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:10:44,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {7379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7373#true} is VALID [2022-04-15 07:10:44,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {7373#true} assume true; {7373#true} is VALID [2022-04-15 07:10:44,862 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7373#true} {7373#true} #92#return; {7373#true} is VALID [2022-04-15 07:10:44,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {7373#true} call ULTIMATE.init(); {7379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:10:44,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {7379#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7373#true} is VALID [2022-04-15 07:10:44,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {7373#true} assume true; {7373#true} is VALID [2022-04-15 07:10:44,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7373#true} {7373#true} #92#return; {7373#true} is VALID [2022-04-15 07:10:44,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {7373#true} call #t~ret10 := main(); {7373#true} is VALID [2022-04-15 07:10:44,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {7373#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {7378#(= main_~a~0 0)} is VALID [2022-04-15 07:10:44,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {7378#(= main_~a~0 0)} [130] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_141| |v_main_#t~pre6_140|)) (.cse1 (= v_main_~c~0_206 v_main_~c~0_204)) (.cse2 (= |v_main_#t~pre8_676| |v_main_#t~pre8_674|)) (.cse3 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse4 (= |v_main_#t~pre5_106| |v_main_#t~pre5_105|)) (.cse5 (= |v_main_#t~pre7_169| |v_main_#t~pre7_168|)) (.cse6 (= v_main_~f~0_1568 v_main_~f~0_1554)) (.cse7 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|)) (.cse8 (= v_main_~d~0_252 v_main_~d~0_250))) (or (and .cse0 .cse1 (= v_main_~b~0_151 v_main_~b~0_149) .cse2 .cse3 (= v_main_~e~0_835 v_main_~e~0_832) .cse4 (= |v_main_#t~pre9_1085| |v_main_#t~pre9_1073|) .cse5 .cse6 .cse7 .cse8) (and .cse0 .cse1 (= |v_main_#t~pre9_1073| |v_main_#t~pre9_1085|) .cse2 .cse3 (= v_main_~b~0_149 v_main_~b~0_151) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_832 v_main_~e~0_835) .cse8))) InVars {main_~e~0=v_main_~e~0_835, main_~d~0=v_main_~d~0_252, main_~b~0=v_main_~b~0_151, main_~f~0=v_main_~f~0_1568, main_#t~pre7=|v_main_#t~pre7_169|, main_~c~0=v_main_~c~0_206, main_#t~pre8=|v_main_#t~pre8_676|, main_#t~pre9=|v_main_#t~pre9_1085|, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_106|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_141|} OutVars{main_~e~0=v_main_~e~0_832, main_~d~0=v_main_~d~0_250, main_~b~0=v_main_~b~0_149, main_~f~0=v_main_~f~0_1554, main_#t~pre7=|v_main_#t~pre7_168|, main_~c~0=v_main_~c~0_204, main_#t~pre8=|v_main_#t~pre8_674|, main_#t~pre9=|v_main_#t~pre9_1073|, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_105|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_140|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7378#(= main_~a~0 0)} is VALID [2022-04-15 07:10:44,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {7378#(= main_~a~0 0)} [129] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7374#false} is VALID [2022-04-15 07:10:44,869 INFO L290 TraceCheckUtils]: 8: Hoare triple {7374#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {7374#false} is VALID [2022-04-15 07:10:44,869 INFO L290 TraceCheckUtils]: 9: Hoare triple {7374#false} assume !false; {7374#false} is VALID [2022-04-15 07:10:44,869 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:44,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:10:44,869 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669996842] [2022-04-15 07:10:44,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669996842] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:44,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:44,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:10:45,251 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:10:45,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [805196659] [2022-04-15 07:10:45,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [805196659] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:10:45,251 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:10:45,251 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 07:10:45,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370805139] [2022-04-15 07:10:45,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:10:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:45,252 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:10:45,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:45,274 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:10:45,274 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 07:10:45,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:45,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 07:10:45,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=386, Unknown=0, NotChecked=0, Total=506 [2022-04-15 07:10:45,275 INFO L87 Difference]: Start difference. First operand 54 states and 59 transitions. Second operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:46,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:46,258 INFO L93 Difference]: Finished difference Result 103 states and 128 transitions. [2022-04-15 07:10:46,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 07:10:46,258 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:46,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:10:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:46,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2022-04-15 07:10:46,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:46,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 128 transitions. [2022-04-15 07:10:46,263 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 128 transitions. [2022-04-15 07:10:46,353 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:10:46,354 INFO L225 Difference]: With dead ends: 103 [2022-04-15 07:10:46,354 INFO L226 Difference]: Without dead ends: 88 [2022-04-15 07:10:46,354 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=354, Invalid=1452, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:10:46,355 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 184 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:10:46,355 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 50 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:10:46,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-15 07:10:46,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 56. [2022-04-15 07:10:46,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:10:46,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:46,375 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:46,376 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:46,376 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-15 07:10:46,376 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-15 07:10:46,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:46,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:46,377 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:10:46,377 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 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:10:46,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:10:46,378 INFO L93 Difference]: Finished difference Result 88 states and 107 transitions. [2022-04-15 07:10:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 107 transitions. [2022-04-15 07:10:46,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:10:46,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:10:46,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:10:46,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:10:46,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.1153846153846154) internal successors, (58), 52 states have internal predecessors, (58), 2 states have call successors, (2), 2 states have call 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:46,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-15 07:10:46,380 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 51 [2022-04-15 07:10:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:10:46,380 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-15 07:10:46,380 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 22 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:10:46,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-15 07:10:46,470 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:10:46,471 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-15 07:10:46,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 07:10:46,471 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:10:46,471 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:10:46,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-15 07:10:46,471 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:10:46,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:10:46,471 INFO L85 PathProgramCache]: Analyzing trace with hash -699284070, now seen corresponding path program 14 times [2022-04-15 07:10:46,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:10:46,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [490561676] [2022-04-15 07:10:48,655 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:48,699 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:48,776 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:48,899 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:48,924 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:52,987 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:53,032 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:53,122 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:53,273 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:53,313 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:57,391 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:10:57,436 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:57,524 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:57,677 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:57,717 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:01,774 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:01,817 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:01,906 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:02,061 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:02,100 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:06,164 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:06,210 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:06,297 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:06,468 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:06,468 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:06,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1832707627, now seen corresponding path program 1 times [2022-04-15 07:11:06,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:06,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504745847] [2022-04-15 07:11:06,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:06,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:06,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:06,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:06,500 INFO L290 TraceCheckUtils]: 0: Hoare triple {7941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7935#true} is VALID [2022-04-15 07:11:06,500 INFO L290 TraceCheckUtils]: 1: Hoare triple {7935#true} assume true; {7935#true} is VALID [2022-04-15 07:11:06,500 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7935#true} {7935#true} #92#return; {7935#true} is VALID [2022-04-15 07:11:06,501 INFO L272 TraceCheckUtils]: 0: Hoare triple {7935#true} call ULTIMATE.init(); {7941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:06,501 INFO L290 TraceCheckUtils]: 1: Hoare triple {7941#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {7935#true} is VALID [2022-04-15 07:11:06,501 INFO L290 TraceCheckUtils]: 2: Hoare triple {7935#true} assume true; {7935#true} is VALID [2022-04-15 07:11:06,501 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7935#true} {7935#true} #92#return; {7935#true} is VALID [2022-04-15 07:11:06,501 INFO L272 TraceCheckUtils]: 4: Hoare triple {7935#true} call #t~ret10 := main(); {7935#true} is VALID [2022-04-15 07:11:06,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {7935#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {7940#(= main_~a~0 0)} is VALID [2022-04-15 07:11:06,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {7940#(= main_~a~0 0)} [132] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_1191| |v_main_#t~pre9_1179|)) (.cse1 (= v_main_~a~0_118 v_main_~a~0_117)) (.cse2 (= v_main_~f~0_1752 v_main_~f~0_1737)) (.cse3 (= |v_main_#t~pre7_177| |v_main_#t~pre7_176|)) (.cse4 (= |v_main_#t~pre6_148| |v_main_#t~pre6_147|)) (.cse5 (= v_main_~c~0_216 v_main_~c~0_214)) (.cse6 (= v_main_~b~0_159 v_main_~b~0_157)) (.cse7 (= v_main_~d~0_264 v_main_~d~0_262)) (.cse8 (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) (.cse9 (= |v_main_#t~pre5_112| |v_main_#t~pre5_111|))) (or (and .cse0 (= v_main_~e~0_930 v_main_~e~0_926) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_761| |v_main_#t~pre8_758|)) (and .cse0 (= v_main_~e~0_926 v_main_~e~0_930) (= |v_main_#t~pre8_758| |v_main_#t~pre8_761|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_930, main_~d~0=v_main_~d~0_264, main_~b~0=v_main_~b~0_159, main_~f~0=v_main_~f~0_1752, main_#t~pre7=|v_main_#t~pre7_177|, main_~c~0=v_main_~c~0_216, main_#t~pre8=|v_main_#t~pre8_761|, main_#t~pre9=|v_main_#t~pre9_1191|, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_112|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_148|} OutVars{main_~e~0=v_main_~e~0_926, main_~d~0=v_main_~d~0_262, main_~b~0=v_main_~b~0_157, main_~f~0=v_main_~f~0_1737, main_#t~pre7=|v_main_#t~pre7_176|, main_~c~0=v_main_~c~0_214, main_#t~pre8=|v_main_#t~pre8_758|, main_#t~pre9=|v_main_#t~pre9_1179|, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_111|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_147|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7940#(= main_~a~0 0)} is VALID [2022-04-15 07:11:06,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {7940#(= main_~a~0 0)} [131] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {7936#false} is VALID [2022-04-15 07:11:06,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {7936#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {7936#false} is VALID [2022-04-15 07:11:06,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {7936#false} assume !false; {7936#false} is VALID [2022-04-15 07:11:06,502 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:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:06,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504745847] [2022-04-15 07:11:06,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504745847] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:06,503 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:06,503 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:07,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:07,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [490561676] [2022-04-15 07:11:07,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [490561676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:07,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:07,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 07:11:07,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875256900] [2022-04-15 07:11:07,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:07,007 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 07:11:07,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:07,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:07,044 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:11:07,044 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 07:11:07,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 07:11:07,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=426, Unknown=0, NotChecked=0, Total=552 [2022-04-15 07:11:07,045 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:08,291 INFO L93 Difference]: Finished difference Result 105 states and 130 transitions. [2022-04-15 07:11:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 07:11:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 54 [2022-04-15 07:11:08,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:08,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2022-04-15 07:11:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:08,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 130 transitions. [2022-04-15 07:11:08,293 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 130 transitions. [2022-04-15 07:11:08,379 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:08,380 INFO L225 Difference]: With dead ends: 105 [2022-04-15 07:11:08,380 INFO L226 Difference]: Without dead ends: 90 [2022-04-15 07:11:08,381 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 27 SyntacticMatches, 6 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 344 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=372, Invalid=1608, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:11:08,382 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 168 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:08,383 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 30 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:11:08,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-15 07:11:08,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 57. [2022-04-15 07:11:08,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:08,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:11:08,401 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:11:08,402 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:11:08,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:08,403 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-04-15 07:11:08,403 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-04-15 07:11:08,403 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:08,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:08,403 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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 90 states. [2022-04-15 07:11:08,403 INFO L87 Difference]: Start difference. First operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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 90 states. [2022-04-15 07:11:08,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:08,404 INFO L93 Difference]: Finished difference Result 90 states and 109 transitions. [2022-04-15 07:11:08,404 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 109 transitions. [2022-04-15 07:11:08,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:08,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:08,404 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:08,404 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:08,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.1132075471698113) internal successors, (59), 53 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:11:08,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-04-15 07:11:08,405 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 54 [2022-04-15 07:11:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:08,405 INFO L478 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-04-15 07:11:08,405 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.125) internal successors, (51), 23 states have internal predecessors, (51), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:11:08,405 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 62 transitions. [2022-04-15 07:11:08,542 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:11:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-04-15 07:11:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-15 07:11:08,542 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:08,542 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:08,542 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-15 07:11:08,542 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:08,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:08,543 INFO L85 PathProgramCache]: Analyzing trace with hash -2081283336, now seen corresponding path program 15 times [2022-04-15 07:11:08,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:08,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [62230678] [2022-04-15 07:11:11,101 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:11,145 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:11,232 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:11,258 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:11,258 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:11,290 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:13,543 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:13,634 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:13,660 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:13,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:13,694 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:17,326 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:17,371 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:17,455 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:17,480 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:17,480 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:17,512 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:21,579 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:21,623 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:21,712 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:21,739 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:21,739 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:21,771 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:25,832 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:25,878 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:25,971 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:26,163 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:26,163 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:26,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1832769131, now seen corresponding path program 1 times [2022-04-15 07:11:26,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:26,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835233392] [2022-04-15 07:11:26,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:26,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:26,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:26,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:26,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {8516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8510#true} is VALID [2022-04-15 07:11:26,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {8510#true} assume true; {8510#true} is VALID [2022-04-15 07:11:26,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8510#true} {8510#true} #92#return; {8510#true} is VALID [2022-04-15 07:11:26,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {8510#true} call ULTIMATE.init(); {8516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:26,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {8516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {8510#true} is VALID [2022-04-15 07:11:26,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {8510#true} assume true; {8510#true} is VALID [2022-04-15 07:11:26,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8510#true} {8510#true} #92#return; {8510#true} is VALID [2022-04-15 07:11:26,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {8510#true} call #t~ret10 := main(); {8510#true} is VALID [2022-04-15 07:11:26,188 INFO L290 TraceCheckUtils]: 5: Hoare triple {8510#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {8515#(= main_~a~0 0)} is VALID [2022-04-15 07:11:26,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {8515#(= main_~a~0 0)} [134] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre9_1306| |v_main_#t~pre9_1293|)) (.cse2 (= v_main_~e~0_1013 v_main_~e~0_1009)) (.cse3 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse4 (= v_main_~b~0_167 v_main_~b~0_165)) (.cse5 (= |v_main_#t~pre5_118| |v_main_#t~pre5_117|)) (.cse6 (= |v_main_#t~pre7_185| |v_main_#t~pre7_184|)) (.cse7 (= v_main_~c~0_226 v_main_~c~0_224)) (.cse8 (= |v_main_#t~pre6_155| |v_main_#t~pre6_154|)) (.cse9 (= v_main_~f~0_1926 v_main_~f~0_1910)) (.cse10 (= v_main_~d~0_276 v_main_~d~0_274))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_830| |v_main_#t~pre8_827|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_827| |v_main_#t~pre8_830|) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1013, main_~d~0=v_main_~d~0_276, main_~b~0=v_main_~b~0_167, main_~f~0=v_main_~f~0_1926, main_#t~pre7=|v_main_#t~pre7_185|, main_~c~0=v_main_~c~0_226, main_#t~pre8=|v_main_#t~pre8_830|, main_#t~pre9=|v_main_#t~pre9_1306|, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_118|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_155|} OutVars{main_~e~0=v_main_~e~0_1009, main_~d~0=v_main_~d~0_274, main_~b~0=v_main_~b~0_165, main_~f~0=v_main_~f~0_1910, main_#t~pre7=|v_main_#t~pre7_184|, main_~c~0=v_main_~c~0_224, main_#t~pre8=|v_main_#t~pre8_827|, main_#t~pre9=|v_main_#t~pre9_1293|, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_117|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_154|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8515#(= main_~a~0 0)} is VALID [2022-04-15 07:11:26,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {8515#(= main_~a~0 0)} [133] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {8511#false} is VALID [2022-04-15 07:11:26,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {8511#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {8511#false} is VALID [2022-04-15 07:11:26,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {8511#false} assume !false; {8511#false} is VALID [2022-04-15 07:11:26,189 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:26,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:26,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835233392] [2022-04-15 07:11:26,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1835233392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:26,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:26,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:26,725 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:26,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [62230678] [2022-04-15 07:11:26,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [62230678] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:26,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:26,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 07:11:26,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468950148] [2022-04-15 07:11:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 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 56 [2022-04-15 07:11:26,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:26,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:26,760 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:11:26,760 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 07:11:26,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:26,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 07:11:26,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2022-04-15 07:11:26,761 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:27,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:27,887 INFO L93 Difference]: Finished difference Result 107 states and 132 transitions. [2022-04-15 07:11:27,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 07:11:27,887 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 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 56 [2022-04-15 07:11:27,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:27,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:27,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-15 07:11:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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:27,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 132 transitions. [2022-04-15 07:11:27,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 132 transitions. [2022-04-15 07:11:27,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:27,978 INFO L225 Difference]: With dead ends: 107 [2022-04-15 07:11:27,978 INFO L226 Difference]: Without dead ends: 92 [2022-04-15 07:11:27,979 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 26 SyntacticMatches, 8 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=390, Invalid=1772, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:11:27,979 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 211 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 646 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 646 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:27,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [211 Valid, 35 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 646 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 07:11:27,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-15 07:11:27,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 59. [2022-04-15 07:11:27,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:27,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:11:27,999 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:11:27,999 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:11:28,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:28,000 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-15 07:11:28,000 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-15 07:11:28,000 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:28,001 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:28,001 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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 92 states. [2022-04-15 07:11:28,001 INFO L87 Difference]: Start difference. First operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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 92 states. [2022-04-15 07:11:28,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:28,002 INFO L93 Difference]: Finished difference Result 92 states and 111 transitions. [2022-04-15 07:11:28,002 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-04-15 07:11:28,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:28,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:28,002 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:28,002 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:28,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 55 states have (on average 1.1090909090909091) internal successors, (61), 55 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:11:28,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-04-15 07:11:28,003 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 56 [2022-04-15 07:11:28,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:28,003 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-04-15 07:11:28,003 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.12) internal successors, (53), 24 states have internal predecessors, (53), 1 states have call successors, (2), 2 states have call 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,003 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 64 transitions. [2022-04-15 07:11:28,126 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:11:28,126 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-04-15 07:11:28,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 07:11:28,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:28,127 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:28,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-15 07:11:28,127 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:28,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:28,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1257283798, now seen corresponding path program 16 times [2022-04-15 07:11:28,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:28,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479130858] [2022-04-15 07:11:28,402 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:28,496 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:28,527 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:28,527 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:28,566 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:28,680 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:28,767 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:28,792 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:28,792 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:28,830 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:28,940 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:29,026 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:29,051 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:29,051 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:29,083 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:29,191 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:29,280 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:29,305 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:29,305 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:29,339 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:29,463 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:29,538 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:29,674 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:29,675 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:29,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1832830635, now seen corresponding path program 1 times [2022-04-15 07:11:29,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:29,675 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146785693] [2022-04-15 07:11:29,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:29,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:29,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:29,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:29,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:29,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {9106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9100#true} is VALID [2022-04-15 07:11:29,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {9100#true} assume true; {9100#true} is VALID [2022-04-15 07:11:29,724 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9100#true} {9100#true} #92#return; {9100#true} is VALID [2022-04-15 07:11:29,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {9100#true} call ULTIMATE.init(); {9106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:29,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {9106#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9100#true} is VALID [2022-04-15 07:11:29,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {9100#true} assume true; {9100#true} is VALID [2022-04-15 07:11:29,725 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9100#true} {9100#true} #92#return; {9100#true} is VALID [2022-04-15 07:11:29,725 INFO L272 TraceCheckUtils]: 4: Hoare triple {9100#true} call #t~ret10 := main(); {9100#true} is VALID [2022-04-15 07:11:29,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {9100#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {9105#(= main_~a~0 0)} is VALID [2022-04-15 07:11:29,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {9105#(= main_~a~0 0)} [136] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_175 v_main_~b~0_173)) (.cse1 (= v_main_~e~0_1096 v_main_~e~0_1092)) (.cse2 (= v_main_~c~0_236 v_main_~c~0_234)) (.cse3 (= v_main_~f~0_2106 v_main_~f~0_2089)) (.cse4 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse5 (= |v_main_#t~pre9_1426| |v_main_#t~pre9_1412|)) (.cse6 (= |v_main_#t~pre6_162| |v_main_#t~pre6_161|)) (.cse7 (= |v_main_#t~pre8_899| |v_main_#t~pre8_896|)) (.cse8 (= v_main_~d~0_288 v_main_~d~0_286)) (.cse9 (= |v_main_#t~pre5_124| |v_main_#t~pre5_123|))) (or (and .cse0 (= |v_main_#t~pre7_193| |v_main_#t~pre7_192|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~a~0_130 v_main_~a~0_129)) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_192| |v_main_#t~pre7_193|) (= v_main_~a~0_129 v_main_~a~0_130) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1096, main_~d~0=v_main_~d~0_288, main_~b~0=v_main_~b~0_175, main_~f~0=v_main_~f~0_2106, main_#t~pre7=|v_main_#t~pre7_193|, main_~c~0=v_main_~c~0_236, main_#t~pre8=|v_main_#t~pre8_899|, main_#t~pre9=|v_main_#t~pre9_1426|, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_124|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_162|} OutVars{main_~e~0=v_main_~e~0_1092, main_~d~0=v_main_~d~0_286, main_~b~0=v_main_~b~0_173, main_~f~0=v_main_~f~0_2089, main_#t~pre7=|v_main_#t~pre7_192|, main_~c~0=v_main_~c~0_234, main_#t~pre8=|v_main_#t~pre8_896|, main_#t~pre9=|v_main_#t~pre9_1412|, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_161|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9105#(= main_~a~0 0)} is VALID [2022-04-15 07:11:29,726 INFO L290 TraceCheckUtils]: 7: Hoare triple {9105#(= main_~a~0 0)} [135] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9101#false} is VALID [2022-04-15 07:11:29,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {9101#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {9101#false} is VALID [2022-04-15 07:11:29,726 INFO L290 TraceCheckUtils]: 9: Hoare triple {9101#false} assume !false; {9101#false} is VALID [2022-04-15 07:11:29,726 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:29,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:29,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146785693] [2022-04-15 07:11:29,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146785693] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:29,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:29,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:30,125 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:30,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1479130858] [2022-04-15 07:11:30,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1479130858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:30,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:30,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 07:11:30,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234575031] [2022-04-15 07:11:30,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:30,126 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 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 58 [2022-04-15 07:11:30,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:30,127 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:30,179 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:11:30,179 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 07:11:30,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:30,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 07:11:30,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=512, Unknown=0, NotChecked=0, Total=650 [2022-04-15 07:11:30,180 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:31,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:31,666 INFO L93 Difference]: Finished difference Result 109 states and 134 transitions. [2022-04-15 07:11:31,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 07:11:31,666 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 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 58 [2022-04-15 07:11:31,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:31,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:31,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2022-04-15 07:11:31,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:31,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 134 transitions. [2022-04-15 07:11:31,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 134 transitions. [2022-04-15 07:11:31,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:31,772 INFO L225 Difference]: With dead ends: 109 [2022-04-15 07:11:31,772 INFO L226 Difference]: Without dead ends: 94 [2022-04-15 07:11:31,773 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 27 SyntacticMatches, 8 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=408, Invalid=1944, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 07:11:31,773 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 218 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 831 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 831 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:31,773 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 30 Invalid, 922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 831 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:11:31,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-15 07:11:31,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-04-15 07:11:31,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:31,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call 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:31,794 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call 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:31,794 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call 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:31,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:31,795 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-15 07:11:31,795 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-15 07:11:31,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:31,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:31,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 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 94 states. [2022-04-15 07:11:31,796 INFO L87 Difference]: Start difference. First operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 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 94 states. [2022-04-15 07:11:31,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:31,797 INFO L93 Difference]: Finished difference Result 94 states and 113 transitions. [2022-04-15 07:11:31,797 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 113 transitions. [2022-04-15 07:11:31,797 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:31,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:31,797 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:31,797 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:31,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 57 states have (on average 1.105263157894737) internal successors, (63), 57 states have internal predecessors, (63), 2 states have call successors, (2), 2 states have call 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:31,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-04-15 07:11:31,798 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 58 [2022-04-15 07:11:31,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:31,798 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-04-15 07:11:31,798 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 25 states have internal predecessors, (55), 1 states have call successors, (2), 2 states have call 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:31,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 66 transitions. [2022-04-15 07:11:31,916 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:11:31,916 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-04-15 07:11:31,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-15 07:11:31,917 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:31,917 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:31,917 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-15 07:11:31,917 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:31,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:31,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1279729460, now seen corresponding path program 17 times [2022-04-15 07:11:31,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:31,917 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1863954190] [2022-04-15 07:11:36,146 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:36,198 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,286 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,311 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:36,311 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:36,345 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:40,417 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:40,470 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:40,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:11:40,582 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:40,582 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:40,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:11:44,686 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:44,739 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,830 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,855 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,856 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:44,890 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:48,159 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:48,209 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:48,295 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:48,319 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:48,319 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:48,353 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:52,426 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:52,477 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:52,567 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:52,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:11:52,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:11:52,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1832892139, now seen corresponding path program 1 times [2022-04-15 07:11:52,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:11:52,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688892182] [2022-04-15 07:11:52,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:11:52,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:11:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:11:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:11:52,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {9711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9705#true} is VALID [2022-04-15 07:11:52,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {9705#true} assume true; {9705#true} is VALID [2022-04-15 07:11:52,760 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9705#true} {9705#true} #92#return; {9705#true} is VALID [2022-04-15 07:11:52,760 INFO L272 TraceCheckUtils]: 0: Hoare triple {9705#true} call ULTIMATE.init(); {9711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:11:52,760 INFO L290 TraceCheckUtils]: 1: Hoare triple {9711#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {9705#true} is VALID [2022-04-15 07:11:52,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {9705#true} assume true; {9705#true} is VALID [2022-04-15 07:11:52,761 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9705#true} {9705#true} #92#return; {9705#true} is VALID [2022-04-15 07:11:52,761 INFO L272 TraceCheckUtils]: 4: Hoare triple {9705#true} call #t~ret10 := main(); {9705#true} is VALID [2022-04-15 07:11:52,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {9705#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {9710#(= main_~a~0 0)} is VALID [2022-04-15 07:11:52,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {9710#(= main_~a~0 0)} [138] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre7_201| |v_main_#t~pre7_200|) (= v_main_~f~0_2292 v_main_~f~0_2274) (= v_main_~a~0_136 v_main_~a~0_135) (= v_main_~d~0_300 v_main_~d~0_298) (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|) (= |v_main_#t~pre8_968| |v_main_#t~pre8_965|) (= |v_main_#t~pre9_1551| |v_main_#t~pre9_1536|) (= v_main_~e~0_1179 v_main_~e~0_1175) (= |v_main_#t~pre5_130| |v_main_#t~pre5_129|) (= v_main_~b~0_183 v_main_~b~0_181) (= |v_main_#t~pre6_169| |v_main_#t~pre6_168|) (= v_main_~c~0_246 v_main_~c~0_244)) InVars {main_~e~0=v_main_~e~0_1179, main_~d~0=v_main_~d~0_300, main_~b~0=v_main_~b~0_183, main_~f~0=v_main_~f~0_2292, main_#t~pre7=|v_main_#t~pre7_201|, main_~c~0=v_main_~c~0_246, main_#t~pre8=|v_main_#t~pre8_968|, main_#t~pre9=|v_main_#t~pre9_1551|, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_130|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_169|} OutVars{main_~e~0=v_main_~e~0_1175, main_~d~0=v_main_~d~0_298, main_~b~0=v_main_~b~0_181, main_~f~0=v_main_~f~0_2274, main_#t~pre7=|v_main_#t~pre7_200|, main_~c~0=v_main_~c~0_244, main_#t~pre8=|v_main_#t~pre8_965|, main_#t~pre9=|v_main_#t~pre9_1536|, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_129|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_168|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9710#(= main_~a~0 0)} is VALID [2022-04-15 07:11:52,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {9710#(= main_~a~0 0)} [137] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {9706#false} is VALID [2022-04-15 07:11:52,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {9706#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {9706#false} is VALID [2022-04-15 07:11:52,763 INFO L290 TraceCheckUtils]: 9: Hoare triple {9706#false} assume !false; {9706#false} is VALID [2022-04-15 07:11:52,763 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:52,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:11:52,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688892182] [2022-04-15 07:11:52,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688892182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:52,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:52,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:11:53,277 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:11:53,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1863954190] [2022-04-15 07:11:53,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1863954190] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:11:53,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:11:53,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 07:11:53,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2080751171] [2022-04-15 07:11:53,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:11:53,278 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:53,278 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:11:53,278 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:53,304 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:11:53,304 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 07:11:53,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:53,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 07:11:53,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=558, Unknown=0, NotChecked=0, Total=702 [2022-04-15 07:11:53,305 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:54,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:54,868 INFO L93 Difference]: Finished difference Result 111 states and 136 transitions. [2022-04-15 07:11:54,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 07:11:54,869 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:11:54,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2022-04-15 07:11:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:54,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 136 transitions. [2022-04-15 07:11:54,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 136 transitions. [2022-04-15 07:11:54,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:11:54,991 INFO L225 Difference]: With dead ends: 111 [2022-04-15 07:11:54,991 INFO L226 Difference]: Without dead ends: 96 [2022-04-15 07:11:54,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 26 SyntacticMatches, 10 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=426, Invalid=2124, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 07:11:54,993 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 195 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 863 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 940 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:11:54,993 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 65 Invalid, 940 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 863 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:11:54,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-15 07:11:55,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 63. [2022-04-15 07:11:55,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:11:55,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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:55,016 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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:55,016 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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:55,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:55,017 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-04-15 07:11:55,017 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-04-15 07:11:55,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:55,017 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:55,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 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:11:55,018 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 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:11:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:11:55,018 INFO L93 Difference]: Finished difference Result 96 states and 115 transitions. [2022-04-15 07:11:55,018 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 115 transitions. [2022-04-15 07:11:55,019 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:11:55,019 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:11:55,019 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:11:55,019 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:11:55,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.1016949152542372) internal successors, (65), 59 states have internal predecessors, (65), 2 states have call successors, (2), 2 states have call 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:55,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 68 transitions. [2022-04-15 07:11:55,019 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 68 transitions. Word has length 60 [2022-04-15 07:11:55,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:11:55,020 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 68 transitions. [2022-04-15 07:11:55,020 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.111111111111111) internal successors, (57), 26 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:11:55,020 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 68 transitions. [2022-04-15 07:11:55,153 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:11:55,153 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 68 transitions. [2022-04-15 07:11:55,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 07:11:55,154 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:11:55,154 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:11:55,154 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-15 07:11:55,154 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:11:55,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:11:55,154 INFO L85 PathProgramCache]: Analyzing trace with hash 1375174162, now seen corresponding path program 18 times [2022-04-15 07:11:55,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:11:55,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [395470903] [2022-04-15 07:11:59,399 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:11:59,444 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:59,536 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:59,557 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:59,557 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:11:59,585 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,676 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:02,732 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,818 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,842 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,843 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:02,875 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:06,951 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:07,001 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:07,089 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:07,114 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:07,114 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:07,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:12:10,252 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:10,304 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,393 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:10,417 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:10,417 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:10,450 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:14,524 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:14,578 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,681 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,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:14,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:14,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1832953643, now seen corresponding path program 1 times [2022-04-15 07:12:14,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:14,843 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953568472] [2022-04-15 07:12:14,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:14,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:14,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:14,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:14,879 INFO L290 TraceCheckUtils]: 0: Hoare triple {10331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10325#true} is VALID [2022-04-15 07:12:14,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {10325#true} assume true; {10325#true} is VALID [2022-04-15 07:12:14,879 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10325#true} {10325#true} #92#return; {10325#true} is VALID [2022-04-15 07:12:14,879 INFO L272 TraceCheckUtils]: 0: Hoare triple {10325#true} call ULTIMATE.init(); {10331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:14,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {10331#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10325#true} is VALID [2022-04-15 07:12:14,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {10325#true} assume true; {10325#true} is VALID [2022-04-15 07:12:14,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10325#true} {10325#true} #92#return; {10325#true} is VALID [2022-04-15 07:12:14,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {10325#true} call #t~ret10 := main(); {10325#true} is VALID [2022-04-15 07:12:14,881 INFO L290 TraceCheckUtils]: 5: Hoare triple {10325#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {10330#(= main_~a~0 0)} is VALID [2022-04-15 07:12:14,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {10330#(= main_~a~0 0)} [140] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_209| |v_main_#t~pre7_208|)) (.cse1 (= v_main_~c~0_256 v_main_~c~0_254)) (.cse2 (= |v_main_#t~pre9_1681| |v_main_#t~pre9_1665|)) (.cse3 (= |v_main_#t~pre5_136| |v_main_#t~pre5_135|)) (.cse4 (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|)) (.cse5 (= v_main_~a~0_142 v_main_~a~0_141)) (.cse6 (= |v_main_#t~pre8_1037| |v_main_#t~pre8_1034|)) (.cse7 (= |v_main_#t~pre6_176| |v_main_#t~pre6_175|)) (.cse8 (= v_main_~d~0_312 v_main_~d~0_310)) (.cse9 (= v_main_~f~0_2484 v_main_~f~0_2465))) (or (and (= v_main_~b~0_189 v_main_~b~0_191) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_1258 v_main_~e~0_1262) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_191 v_main_~b~0_189) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_1262 v_main_~e~0_1258) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1262, main_~d~0=v_main_~d~0_312, main_~b~0=v_main_~b~0_191, main_~f~0=v_main_~f~0_2484, main_#t~pre7=|v_main_#t~pre7_209|, main_~c~0=v_main_~c~0_256, main_#t~pre8=|v_main_#t~pre8_1037|, main_#t~pre9=|v_main_#t~pre9_1681|, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_136|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_176|} OutVars{main_~e~0=v_main_~e~0_1258, main_~d~0=v_main_~d~0_310, main_~b~0=v_main_~b~0_189, main_~f~0=v_main_~f~0_2465, main_#t~pre7=|v_main_#t~pre7_208|, main_~c~0=v_main_~c~0_254, main_#t~pre8=|v_main_#t~pre8_1034|, main_#t~pre9=|v_main_#t~pre9_1665|, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_135|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_175|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10330#(= main_~a~0 0)} is VALID [2022-04-15 07:12:14,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {10330#(= main_~a~0 0)} [139] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10326#false} is VALID [2022-04-15 07:12:14,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {10326#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {10326#false} is VALID [2022-04-15 07:12:14,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {10326#false} assume !false; {10326#false} is VALID [2022-04-15 07:12:14,883 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:14,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:14,883 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953568472] [2022-04-15 07:12:14,883 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953568472] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:14,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:14,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:15,413 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:15,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [395470903] [2022-04-15 07:12:15,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [395470903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:15,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:15,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 07:12:15,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750784292] [2022-04-15 07:12:15,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:15,415 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:15,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:15,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:15,444 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:12:15,444 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 07:12:15,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:15,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 07:12:15,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=606, Unknown=0, NotChecked=0, Total=756 [2022-04-15 07:12:15,445 INFO L87 Difference]: Start difference. First operand 63 states and 68 transitions. Second operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:16,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:16,724 INFO L93 Difference]: Finished difference Result 113 states and 138 transitions. [2022-04-15 07:12:16,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 07:12:16,724 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:16,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:16,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2022-04-15 07:12:16,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:16,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 138 transitions. [2022-04-15 07:12:16,726 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 138 transitions. [2022-04-15 07:12:16,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:16,803 INFO L225 Difference]: With dead ends: 113 [2022-04-15 07:12:16,803 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 07:12:16,804 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 26 SyntacticMatches, 11 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 500 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=444, Invalid=2312, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:12:16,805 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 249 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 881 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 982 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 881 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:16,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 30 Invalid, 982 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 881 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 07:12:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 07:12:16,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 65. [2022-04-15 07:12:16,830 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:16,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call 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,831 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call 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,831 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call 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,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:16,832 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-15 07:12:16,832 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-15 07:12:16,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:16,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:16,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 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 98 states. [2022-04-15 07:12:16,832 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 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 98 states. [2022-04-15 07:12:16,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:16,833 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-15 07:12:16,833 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-15 07:12:16,833 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:16,833 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:16,833 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:16,833 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:16,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.098360655737705) internal successors, (67), 61 states have internal predecessors, (67), 2 states have call successors, (2), 2 states have call 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,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-04-15 07:12:16,834 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 62 [2022-04-15 07:12:16,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:16,834 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-04-15 07:12:16,834 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.107142857142857) internal successors, (59), 27 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:12:16,834 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 70 transitions. [2022-04-15 07:12:16,980 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:12:16,980 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-04-15 07:12:16,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-15 07:12:16,980 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:16,980 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:16,980 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-15 07:12:16,981 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:16,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:16,981 INFO L85 PathProgramCache]: Analyzing trace with hash -1391747728, now seen corresponding path program 19 times [2022-04-15 07:12:16,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:16,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [920256138] [2022-04-15 07:12:21,063 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:21,168 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:21,192 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:21,192 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:21,224 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:23,381 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:23,461 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:23,482 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:23,482 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:23,510 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:27,574 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:27,620 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,701 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,721 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:27,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:27,751 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:31,813 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:31,858 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:31,946 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:31,970 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:31,971 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:32,003 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:34,137 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:34,228 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:34,394 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:34,394 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:34,395 INFO L85 PathProgramCache]: Analyzing trace with hash 1833015147, now seen corresponding path program 1 times [2022-04-15 07:12:34,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:34,395 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461413749] [2022-04-15 07:12:34,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:34,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:34,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:34,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:34,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {10966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10960#true} is VALID [2022-04-15 07:12:34,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {10960#true} assume true; {10960#true} is VALID [2022-04-15 07:12:34,417 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10960#true} {10960#true} #92#return; {10960#true} is VALID [2022-04-15 07:12:34,417 INFO L272 TraceCheckUtils]: 0: Hoare triple {10960#true} call ULTIMATE.init(); {10966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:34,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {10966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {10960#true} is VALID [2022-04-15 07:12:34,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {10960#true} assume true; {10960#true} is VALID [2022-04-15 07:12:34,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10960#true} {10960#true} #92#return; {10960#true} is VALID [2022-04-15 07:12:34,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {10960#true} call #t~ret10 := main(); {10960#true} is VALID [2022-04-15 07:12:34,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {10960#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {10965#(= main_~a~0 0)} is VALID [2022-04-15 07:12:34,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {10965#(= main_~a~0 0)} [142] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_217| |v_main_#t~pre7_216|)) (.cse1 (= v_main_~e~0_1345 v_main_~e~0_1341)) (.cse2 (= v_main_~c~0_266 v_main_~c~0_264)) (.cse3 (= v_main_~d~0_324 v_main_~d~0_322)) (.cse4 (= v_main_~b~0_199 v_main_~b~0_197)) (.cse5 (= |v_main_#t~pre9_1816| |v_main_#t~pre9_1799|)) (.cse6 (= v_main_~a~0_148 v_main_~a~0_147)) (.cse7 (= |v_main_#t~pre5_142| |v_main_#t~pre5_141|)) (.cse8 (= v_main_~f~0_2682 v_main_~f~0_2662)) (.cse9 (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_183| |v_main_#t~pre6_182|) .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1106| |v_main_#t~pre8_1103|) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1103| |v_main_#t~pre8_1106|) (= |v_main_#t~pre6_182| |v_main_#t~pre6_183|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1345, main_~d~0=v_main_~d~0_324, main_~b~0=v_main_~b~0_199, main_~f~0=v_main_~f~0_2682, main_#t~pre7=|v_main_#t~pre7_217|, main_~c~0=v_main_~c~0_266, main_#t~pre8=|v_main_#t~pre8_1106|, main_#t~pre9=|v_main_#t~pre9_1816|, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_142|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_183|} OutVars{main_~e~0=v_main_~e~0_1341, main_~d~0=v_main_~d~0_322, main_~b~0=v_main_~b~0_197, main_~f~0=v_main_~f~0_2662, main_#t~pre7=|v_main_#t~pre7_216|, main_~c~0=v_main_~c~0_264, main_#t~pre8=|v_main_#t~pre8_1103|, main_#t~pre9=|v_main_#t~pre9_1799|, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_141|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_182|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10965#(= main_~a~0 0)} is VALID [2022-04-15 07:12:34,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {10965#(= main_~a~0 0)} [141] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {10961#false} is VALID [2022-04-15 07:12:34,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {10961#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {10961#false} is VALID [2022-04-15 07:12:34,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {10961#false} assume !false; {10961#false} is VALID [2022-04-15 07:12:34,419 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:34,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:34,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461413749] [2022-04-15 07:12:34,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461413749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:34,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:34,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:35,054 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:35,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [920256138] [2022-04-15 07:12:35,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [920256138] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:35,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:35,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 07:12:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870834140] [2022-04-15 07:12:35,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:35,055 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:35,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:35,056 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:35,099 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:12:35,099 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 07:12:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 07:12:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=656, Unknown=0, NotChecked=0, Total=812 [2022-04-15 07:12:35,100 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:36,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,747 INFO L93 Difference]: Finished difference Result 117 states and 143 transitions. [2022-04-15 07:12:36,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 07:12:36,747 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:36,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:36,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:36,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-04-15 07:12:36,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:36,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 143 transitions. [2022-04-15 07:12:36,752 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 143 transitions. [2022-04-15 07:12:36,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:36,862 INFO L225 Difference]: With dead ends: 117 [2022-04-15 07:12:36,862 INFO L226 Difference]: Without dead ends: 102 [2022-04-15 07:12:36,863 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=462, Invalid=2508, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 07:12:36,863 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 208 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1043 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:36,864 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 45 Invalid, 1043 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:12:36,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-04-15 07:12:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 69. [2022-04-15 07:12:36,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:36,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:36,891 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:36,891 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:36,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,893 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-04-15 07:12:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-04-15 07:12:36,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:36,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:36,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 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 102 states. [2022-04-15 07:12:36,893 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 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 102 states. [2022-04-15 07:12:36,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:36,895 INFO L93 Difference]: Finished difference Result 102 states and 121 transitions. [2022-04-15 07:12:36,895 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 121 transitions. [2022-04-15 07:12:36,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:36,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:36,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:36,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0923076923076922) internal successors, (71), 65 states have internal predecessors, (71), 2 states have call successors, (2), 2 states have call 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:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 74 transitions. [2022-04-15 07:12:36,896 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 74 transitions. Word has length 64 [2022-04-15 07:12:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:36,896 INFO L478 AbstractCegarLoop]: Abstraction has 69 states and 74 transitions. [2022-04-15 07:12:36,896 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.103448275862069) internal successors, (61), 28 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:12:36,896 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 74 transitions. [2022-04-15 07:12:37,037 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:12:37,038 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 74 transitions. [2022-04-15 07:12:37,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 07:12:37,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:37,038 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:37,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-15 07:12:37,038 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:37,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1818927794, now seen corresponding path program 20 times [2022-04-15 07:12:37,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:37,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [52985386] [2022-04-15 07:12:37,286 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:37,374 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:37,399 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:37,399 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:37,493 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:37,582 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:37,608 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:37,608 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:37,714 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:37,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:12:37,826 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:37,826 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:37,919 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:38,009 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:38,035 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:38,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:12:38,110 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:38,172 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:38,301 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:12:38,301 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:12:38,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1833076651, now seen corresponding path program 1 times [2022-04-15 07:12:38,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:12:38,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89941787] [2022-04-15 07:12:38,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:12:38,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:12:38,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:12:38,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:12:38,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {11628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11622#true} is VALID [2022-04-15 07:12:38,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-15 07:12:38,323 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11622#true} {11622#true} #92#return; {11622#true} is VALID [2022-04-15 07:12:38,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {11622#true} call ULTIMATE.init(); {11628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:12:38,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {11628#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {11622#true} is VALID [2022-04-15 07:12:38,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {11622#true} assume true; {11622#true} is VALID [2022-04-15 07:12:38,323 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11622#true} {11622#true} #92#return; {11622#true} is VALID [2022-04-15 07:12:38,324 INFO L272 TraceCheckUtils]: 4: Hoare triple {11622#true} call #t~ret10 := main(); {11622#true} is VALID [2022-04-15 07:12:38,324 INFO L290 TraceCheckUtils]: 5: Hoare triple {11622#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {11627#(= main_~a~0 0)} is VALID [2022-04-15 07:12:38,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {11627#(= main_~a~0 0)} [144] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_276 v_main_~c~0_274)) (.cse1 (= |v_main_#t~pre9_1930| |v_main_#t~pre9_1912|)) (.cse2 (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|)) (.cse3 (= v_main_~f~0_2859 v_main_~f~0_2838)) (.cse4 (= v_main_~d~0_336 v_main_~d~0_334)) (.cse5 (= |v_main_#t~pre7_225| |v_main_#t~pre7_224|)) (.cse6 (= v_main_~b~0_207 v_main_~b~0_205)) (.cse7 (= |v_main_#t~pre5_148| |v_main_#t~pre5_147|)) (.cse8 (= |v_main_#t~pre6_190| |v_main_#t~pre6_189|)) (.cse9 (= |v_main_#t~pre8_1154| |v_main_#t~pre8_1151|)) (.cse10 (= v_main_~a~0_154 v_main_~a~0_153))) (or (and .cse0 .cse1 (= v_main_~e~0_1406 v_main_~e~0_1402) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 (= v_main_~e~0_1402 v_main_~e~0_1406) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1406, main_~d~0=v_main_~d~0_336, main_~b~0=v_main_~b~0_207, main_~f~0=v_main_~f~0_2859, main_#t~pre7=|v_main_#t~pre7_225|, main_~c~0=v_main_~c~0_276, main_#t~pre8=|v_main_#t~pre8_1154|, main_#t~pre9=|v_main_#t~pre9_1930|, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_148|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_190|} OutVars{main_~e~0=v_main_~e~0_1402, main_~d~0=v_main_~d~0_334, main_~b~0=v_main_~b~0_205, main_~f~0=v_main_~f~0_2838, main_#t~pre7=|v_main_#t~pre7_224|, main_~c~0=v_main_~c~0_274, main_#t~pre8=|v_main_#t~pre8_1151|, main_#t~pre9=|v_main_#t~pre9_1912|, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_189|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11627#(= main_~a~0 0)} is VALID [2022-04-15 07:12:38,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {11627#(= main_~a~0 0)} [143] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {11623#false} is VALID [2022-04-15 07:12:38,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {11623#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {11623#false} is VALID [2022-04-15 07:12:38,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {11623#false} assume !false; {11623#false} is VALID [2022-04-15 07:12:38,325 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:38,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:12:38,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89941787] [2022-04-15 07:12:38,325 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89941787] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:38,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:38,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:12:38,883 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:12:38,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [52985386] [2022-04-15 07:12:38,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [52985386] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:12:38,884 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:12:38,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 07:12:38,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117154446] [2022-04-15 07:12:38,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:12:38,884 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:38,884 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:12:38,885 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:38,913 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:12:38,913 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 07:12:38,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:38,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 07:12:38,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=708, Unknown=0, NotChecked=0, Total=870 [2022-04-15 07:12:38,914 INFO L87 Difference]: Start difference. First operand 69 states and 74 transitions. Second operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:40,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:40,758 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-15 07:12:40,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 07:12:40,758 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:40,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:12:40,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:40,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 143 transitions. [2022-04-15 07:12:40,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:40,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 143 transitions. [2022-04-15 07:12:40,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 143 transitions. [2022-04-15 07:12:40,826 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:12:40,827 INFO L225 Difference]: With dead ends: 118 [2022-04-15 07:12:40,827 INFO L226 Difference]: Without dead ends: 103 [2022-04-15 07:12:40,828 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 27 SyntacticMatches, 12 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=480, Invalid=2712, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:12:40,828 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 194 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:12:40,832 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 45 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 07:12:40,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-15 07:12:40,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 71. [2022-04-15 07:12:40,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:12:40,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:40,861 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:40,861 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:40,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:40,862 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-15 07:12:40,863 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-15 07:12:40,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:40,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:40,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 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:40,863 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 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:40,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:12:40,864 INFO L93 Difference]: Finished difference Result 103 states and 122 transitions. [2022-04-15 07:12:40,864 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 122 transitions. [2022-04-15 07:12:40,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:12:40,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:12:40,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:12:40,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:12:40,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.0895522388059702) internal successors, (73), 67 states have internal predecessors, (73), 2 states have call successors, (2), 2 states have call 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:40,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-04-15 07:12:40,865 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 66 [2022-04-15 07:12:40,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:12:40,865 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-04-15 07:12:40,865 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1) internal successors, (63), 29 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:12:40,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 76 transitions. [2022-04-15 07:12:41,041 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:12:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-04-15 07:12:41,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 07:12:41,042 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:12:41,042 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:12:41,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-15 07:12:41,042 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:12:41,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:12:41,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1044035175, now seen corresponding path program 21 times [2022-04-15 07:12:41,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:12:41,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1318884616] [2022-04-15 07:12:44,264 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:44,308 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:44,384 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:48,490 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:48,558 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:48,597 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:52,667 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:52,717 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:52,806 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:56,914 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:56,980 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:57,020 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:59,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:12:59,801 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:59,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:13:03,988 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:04,056 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:13:04,099 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:13:08,171 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:08,221 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:08,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:13:11,416 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:11,483 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:13:11,522 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:13:13,613 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:13,665 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:13,774 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:13,994 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:13,994 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:13,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1833138155, now seen corresponding path program 1 times [2022-04-15 07:13:13,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:13,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315498508] [2022-04-15 07:13:13,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:13,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:13,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:14,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:14,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:14,019 INFO L290 TraceCheckUtils]: 0: Hoare triple {12301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12295#true} is VALID [2022-04-15 07:13:14,019 INFO L290 TraceCheckUtils]: 1: Hoare triple {12295#true} assume true; {12295#true} is VALID [2022-04-15 07:13:14,019 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12295#true} {12295#true} #92#return; {12295#true} is VALID [2022-04-15 07:13:14,020 INFO L272 TraceCheckUtils]: 0: Hoare triple {12295#true} call ULTIMATE.init(); {12301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:14,020 INFO L290 TraceCheckUtils]: 1: Hoare triple {12301#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12295#true} is VALID [2022-04-15 07:13:14,020 INFO L290 TraceCheckUtils]: 2: Hoare triple {12295#true} assume true; {12295#true} is VALID [2022-04-15 07:13:14,020 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12295#true} {12295#true} #92#return; {12295#true} is VALID [2022-04-15 07:13:14,020 INFO L272 TraceCheckUtils]: 4: Hoare triple {12295#true} call #t~ret10 := main(); {12295#true} is VALID [2022-04-15 07:13:14,020 INFO L290 TraceCheckUtils]: 5: Hoare triple {12295#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {12300#(= main_~a~0 0)} is VALID [2022-04-15 07:13:14,021 INFO L290 TraceCheckUtils]: 6: Hoare triple {12300#(= main_~a~0 0)} [146] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse1 (= v_main_~f~0_3078 v_main_~f~0_3056)) (.cse2 (= v_main_~d~0_348 v_main_~d~0_346)) (.cse3 (= v_main_~c~0_286 v_main_~c~0_284)) (.cse4 (= v_main_~b~0_215 v_main_~b~0_213)) (.cse5 (= |v_main_#t~pre9_2060| |v_main_#t~pre9_2042|)) (.cse6 (= |v_main_#t~pre6_197| |v_main_#t~pre6_196|)) (.cse7 (= |v_main_#t~pre7_233| |v_main_#t~pre7_232|)) (.cse8 (= |v_main_#t~pre5_154| |v_main_#t~pre5_153|))) (or (and (= |v_main_#t~pre8_1239| |v_main_#t~pre8_1243|) .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_159 v_main_~a~0_160) .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_1501 v_main_~e~0_1506) .cse8) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_1506 v_main_~e~0_1501) (= v_main_~a~0_160 v_main_~a~0_159) .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1243| |v_main_#t~pre8_1239|)))) InVars {main_~e~0=v_main_~e~0_1506, main_~d~0=v_main_~d~0_348, main_~b~0=v_main_~b~0_215, main_~f~0=v_main_~f~0_3078, main_#t~pre7=|v_main_#t~pre7_233|, main_~c~0=v_main_~c~0_286, main_#t~pre8=|v_main_#t~pre8_1243|, main_#t~pre9=|v_main_#t~pre9_2060|, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_154|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_197|} OutVars{main_~e~0=v_main_~e~0_1501, main_~d~0=v_main_~d~0_346, main_~b~0=v_main_~b~0_213, main_~f~0=v_main_~f~0_3056, main_#t~pre7=|v_main_#t~pre7_232|, main_~c~0=v_main_~c~0_284, main_#t~pre8=|v_main_#t~pre8_1239|, main_#t~pre9=|v_main_#t~pre9_2042|, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_153|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_196|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12300#(= main_~a~0 0)} is VALID [2022-04-15 07:13:14,021 INFO L290 TraceCheckUtils]: 7: Hoare triple {12300#(= main_~a~0 0)} [145] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12296#false} is VALID [2022-04-15 07:13:14,021 INFO L290 TraceCheckUtils]: 8: Hoare triple {12296#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {12296#false} is VALID [2022-04-15 07:13:14,021 INFO L290 TraceCheckUtils]: 9: Hoare triple {12296#false} assume !false; {12296#false} is VALID [2022-04-15 07:13:14,021 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:14,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:14,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315498508] [2022-04-15 07:13:14,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315498508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:14,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:14,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:14,816 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:14,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1318884616] [2022-04-15 07:13:14,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1318884616] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:14,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:14,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 07:13:14,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474517767] [2022-04-15 07:13:14,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:14,818 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 07:13:14,818 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:14,818 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:14,850 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:13:14,850 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 07:13:14,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:14,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 07:13:14,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2022-04-15 07:13:14,851 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:16,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:16,452 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-04-15 07:13:16,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 07:13:16,452 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 69 [2022-04-15 07:13:16,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:16,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:16,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2022-04-15 07:13:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:16,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 145 transitions. [2022-04-15 07:13:16,455 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 145 transitions. [2022-04-15 07:13:16,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:16,571 INFO L225 Difference]: With dead ends: 120 [2022-04-15 07:13:16,571 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 07:13:16,572 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 28 SyntacticMatches, 13 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 638 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=498, Invalid=2924, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 07:13:16,573 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 191 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1152 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 1218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 1152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:16,573 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 40 Invalid, 1218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 1152 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 07:13:16,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 07:13:16,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 72. [2022-04-15 07:13:16,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:16,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:13:16,609 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:13:16,609 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:13:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:16,610 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-04-15 07:13:16,610 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2022-04-15 07:13:16,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:16,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:16,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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 105 states. [2022-04-15 07:13:16,610 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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 105 states. [2022-04-15 07:13:16,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:16,611 INFO L93 Difference]: Finished difference Result 105 states and 124 transitions. [2022-04-15 07:13:16,611 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 124 transitions. [2022-04-15 07:13:16,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:16,611 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:16,611 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:16,611 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.088235294117647) internal successors, (74), 68 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:13:16,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-04-15 07:13:16,612 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 69 [2022-04-15 07:13:16,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:16,612 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-04-15 07:13:16,612 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:13:16,612 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 77 transitions. [2022-04-15 07:13:16,771 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:13:16,771 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-04-15 07:13:16,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 07:13:16,771 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:16,771 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:16,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-15 07:13:16,772 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:16,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:16,773 INFO L85 PathProgramCache]: Analyzing trace with hash -1788734331, now seen corresponding path program 22 times [2022-04-15 07:13:16,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:16,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1208124576] [2022-04-15 07:13:21,015 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:21,078 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,170 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:21,196 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:21,196 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:21,229 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:25,307 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:25,360 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:25,449 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,474 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:25,474 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:25,506 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:29,580 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:29,632 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:29,724 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:29,751 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:29,751 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:29,783 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:32,066 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:32,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:13:32,182 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:32,183 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:32,215 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:36,287 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:36,339 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:36,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:13:36,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:13:36,627 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:13:36,627 INFO L85 PathProgramCache]: Analyzing trace with hash 1833199659, now seen corresponding path program 1 times [2022-04-15 07:13:36,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:13:36,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614218667] [2022-04-15 07:13:36,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:13:36,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:13:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:36,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:13:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:13:36,661 INFO L290 TraceCheckUtils]: 0: Hoare triple {12987#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12981#true} is VALID [2022-04-15 07:13:36,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {12981#true} assume true; {12981#true} is VALID [2022-04-15 07:13:36,661 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12981#true} {12981#true} #92#return; {12981#true} is VALID [2022-04-15 07:13:36,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {12981#true} call ULTIMATE.init(); {12987#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:13:36,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {12987#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {12981#true} is VALID [2022-04-15 07:13:36,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {12981#true} assume true; {12981#true} is VALID [2022-04-15 07:13:36,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12981#true} {12981#true} #92#return; {12981#true} is VALID [2022-04-15 07:13:36,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {12981#true} call #t~ret10 := main(); {12981#true} is VALID [2022-04-15 07:13:36,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {12981#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {12986#(= main_~a~0 0)} is VALID [2022-04-15 07:13:36,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {12986#(= main_~a~0 0)} [148] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_360 v_main_~d~0_358)) (.cse1 (= v_main_~e~0_1594 v_main_~e~0_1589)) (.cse2 (= v_main_~a~0_166 v_main_~a~0_165)) (.cse3 (= v_main_~f~0_3287 v_main_~f~0_3264)) (.cse4 (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|)) (.cse5 (= v_main_~c~0_296 v_main_~c~0_294)) (.cse6 (= v_main_~b~0_223 v_main_~b~0_221)) (.cse7 (= |v_main_#t~pre7_241| |v_main_#t~pre7_240|)) (.cse8 (= |v_main_#t~pre6_204| |v_main_#t~pre6_203|)) (.cse9 (= |v_main_#t~pre8_1316| |v_main_#t~pre8_1312|))) (or (and .cse0 .cse1 (= |v_main_#t~pre5_160| |v_main_#t~pre5_159|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre9_2199| |v_main_#t~pre9_2180|)) (and .cse0 (= |v_main_#t~pre5_159| |v_main_#t~pre5_160|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre9_2180| |v_main_#t~pre9_2199|) .cse9))) InVars {main_~e~0=v_main_~e~0_1594, main_~d~0=v_main_~d~0_360, main_~b~0=v_main_~b~0_223, main_~f~0=v_main_~f~0_3287, main_#t~pre7=|v_main_#t~pre7_241|, main_~c~0=v_main_~c~0_296, main_#t~pre8=|v_main_#t~pre8_1316|, main_#t~pre9=|v_main_#t~pre9_2199|, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_160|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_204|} OutVars{main_~e~0=v_main_~e~0_1589, main_~d~0=v_main_~d~0_358, main_~b~0=v_main_~b~0_221, main_~f~0=v_main_~f~0_3264, main_#t~pre7=|v_main_#t~pre7_240|, main_~c~0=v_main_~c~0_294, main_#t~pre8=|v_main_#t~pre8_1312|, main_#t~pre9=|v_main_#t~pre9_2180|, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_159|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_203|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12986#(= main_~a~0 0)} is VALID [2022-04-15 07:13:36,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {12986#(= main_~a~0 0)} [147] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {12982#false} is VALID [2022-04-15 07:13:36,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {12982#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {12982#false} is VALID [2022-04-15 07:13:36,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {12982#false} assume !false; {12982#false} is VALID [2022-04-15 07:13:36,663 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:36,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:13:36,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614218667] [2022-04-15 07:13:36,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614218667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:36,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:36,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:13:37,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:13:37,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1208124576] [2022-04-15 07:13:37,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1208124576] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:13:37,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:13:37,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 07:13:37,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885795357] [2022-04-15 07:13:37,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:13:37,539 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 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 71 [2022-04-15 07:13:37,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:13:37,540 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:37,603 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:13:37,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 07:13:37,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:37,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 07:13:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=818, Unknown=0, NotChecked=0, Total=992 [2022-04-15 07:13:37,604 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:39,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:39,879 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2022-04-15 07:13:39,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 07:13:39,880 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 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 71 [2022-04-15 07:13:39,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:13:39,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2022-04-15 07:13:39,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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:39,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 147 transitions. [2022-04-15 07:13:39,881 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 147 transitions. [2022-04-15 07:13:39,990 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:13:39,991 INFO L225 Difference]: With dead ends: 122 [2022-04-15 07:13:39,991 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 07:13:39,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 30 SyntacticMatches, 12 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 679 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=516, Invalid=3144, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 07:13:39,992 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 242 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:13:39,992 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [242 Valid, 55 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 07:13:39,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 07:13:40,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2022-04-15 07:13:40,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:13:40,024 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:13:40,024 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:13:40,024 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:13:40,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,025 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-04-15 07:13:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2022-04-15 07:13:40,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,026 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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 107 states. [2022-04-15 07:13:40,026 INFO L87 Difference]: Start difference. First operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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 107 states. [2022-04-15 07:13:40,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:13:40,027 INFO L93 Difference]: Finished difference Result 107 states and 126 transitions. [2022-04-15 07:13:40,027 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 126 transitions. [2022-04-15 07:13:40,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:13:40,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:13:40,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:13:40,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:13:40,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 70 states have (on average 1.0857142857142856) internal successors, (76), 70 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:13:40,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2022-04-15 07:13:40,028 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 71 [2022-04-15 07:13:40,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:13:40,028 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2022-04-15 07:13:40,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 1 states have call successors, (2), 2 states have call 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,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 79 transitions. [2022-04-15 07:13:40,202 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:13:40,202 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2022-04-15 07:13:40,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 07:13:40,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:13:40,202 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:13:40,202 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-15 07:13:40,203 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:13:40,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:13:40,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1070963933, now seen corresponding path program 23 times [2022-04-15 07:13:40,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:13:40,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1591812695] [2022-04-15 07:13:44,454 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:44,483 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:44,547 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:44,563 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:44,563 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:44,585 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:48,636 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:48,679 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:48,766 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:48,790 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:48,790 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:48,822 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:52,885 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:52,928 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:53,035 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:53,058 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:53,059 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:53,091 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:57,159 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:13:57,202 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:57,289 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:57,313 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:57,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:13:57,339 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:14:01,394 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:01,440 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:14:01,531 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:14:01,738 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:01,738 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:01,739 INFO L85 PathProgramCache]: Analyzing trace with hash 1833261163, now seen corresponding path program 1 times [2022-04-15 07:14:01,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:01,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83839503] [2022-04-15 07:14:01,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:01,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:01,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:01,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:01,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:01,765 INFO L290 TraceCheckUtils]: 0: Hoare triple {13688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {13682#true} assume true; {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13682#true} {13682#true} #92#return; {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {13682#true} call ULTIMATE.init(); {13688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:01,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {13688#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {13682#true} assume true; {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13682#true} {13682#true} #92#return; {13682#true} is VALID [2022-04-15 07:14:01,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {13682#true} call #t~ret10 := main(); {13682#true} is VALID [2022-04-15 07:14:01,767 INFO L290 TraceCheckUtils]: 5: Hoare triple {13682#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {13687#(= main_~a~0 0)} is VALID [2022-04-15 07:14:01,768 INFO L290 TraceCheckUtils]: 6: Hoare triple {13687#(= main_~a~0 0)} [150] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|)) (.cse1 (= |v_main_#t~pre8_1389| |v_main_#t~pre8_1385|)) (.cse2 (= |v_main_#t~pre7_249| |v_main_#t~pre7_248|)) (.cse3 (= v_main_~a~0_172 v_main_~a~0_171)) (.cse4 (= v_main_~f~0_3502 v_main_~f~0_3478)) (.cse5 (= |v_main_#t~pre9_2343| |v_main_#t~pre9_2323|)) (.cse6 (= v_main_~d~0_372 v_main_~d~0_370)) (.cse7 (= |v_main_#t~pre5_166| |v_main_#t~pre5_165|)) (.cse8 (= |v_main_#t~pre6_211| |v_main_#t~pre6_210|)) (.cse9 (= v_main_~c~0_306 v_main_~c~0_304))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~b~0_231 v_main_~b~0_229) (= v_main_~e~0_1682 v_main_~e~0_1677) .cse8 .cse9) (and (= v_main_~b~0_229 v_main_~b~0_231) .cse0 .cse1 (= v_main_~e~0_1677 v_main_~e~0_1682) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_1682, main_~d~0=v_main_~d~0_372, main_~b~0=v_main_~b~0_231, main_~f~0=v_main_~f~0_3502, main_#t~pre7=|v_main_#t~pre7_249|, main_~c~0=v_main_~c~0_306, main_#t~pre8=|v_main_#t~pre8_1389|, main_#t~pre9=|v_main_#t~pre9_2343|, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_166|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_211|} OutVars{main_~e~0=v_main_~e~0_1677, main_~d~0=v_main_~d~0_370, main_~b~0=v_main_~b~0_229, main_~f~0=v_main_~f~0_3478, main_#t~pre7=|v_main_#t~pre7_248|, main_~c~0=v_main_~c~0_304, main_#t~pre8=|v_main_#t~pre8_1385|, main_#t~pre9=|v_main_#t~pre9_2323|, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_165|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_210|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13687#(= main_~a~0 0)} is VALID [2022-04-15 07:14:01,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {13687#(= main_~a~0 0)} [149] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {13683#false} is VALID [2022-04-15 07:14:01,769 INFO L290 TraceCheckUtils]: 8: Hoare triple {13683#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {13683#false} is VALID [2022-04-15 07:14:01,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {13683#false} assume !false; {13683#false} is VALID [2022-04-15 07:14:01,769 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:14:01,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:01,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83839503] [2022-04-15 07:14:01,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83839503] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:01,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:01,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:02,634 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:02,634 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1591812695] [2022-04-15 07:14:02,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1591812695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:02,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:02,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 07:14:02,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210182807] [2022-04-15 07:14:02,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:02,635 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 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 73 [2022-04-15 07:14:02,635 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:02,635 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:02,684 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:14:02,684 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 07:14:02,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:02,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 07:14:02,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=876, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 07:14:02,685 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:05,247 INFO L93 Difference]: Finished difference Result 124 states and 149 transitions. [2022-04-15 07:14:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 07:14:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 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 73 [2022-04-15 07:14:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:05,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 07:14:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 07:14:05,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 149 transitions. [2022-04-15 07:14:05,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:05,365 INFO L225 Difference]: With dead ends: 124 [2022-04-15 07:14:05,365 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 07:14:05,366 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 32 SyntacticMatches, 11 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=534, Invalid=3372, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:14:05,366 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 195 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1525 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 1595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:05,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 35 Invalid, 1595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:14:05,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 07:14:05,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 76. [2022-04-15 07:14:05,402 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:05,402 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,402 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,402 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:05,420 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-15 07:14:05,420 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-04-15 07:14:05,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:05,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:05,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 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 109 states. [2022-04-15 07:14:05,420 INFO L87 Difference]: Start difference. First operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 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 109 states. [2022-04-15 07:14:05,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:05,421 INFO L93 Difference]: Finished difference Result 109 states and 128 transitions. [2022-04-15 07:14:05,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 128 transitions. [2022-04-15 07:14:05,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:05,422 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:05,422 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:05,422 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:05,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 72 states have (on average 1.0833333333333333) internal successors, (78), 72 states have internal predecessors, (78), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2022-04-15 07:14:05,423 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 73 [2022-04-15 07:14:05,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:05,423 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2022-04-15 07:14:05,423 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:05,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 81 transitions. [2022-04-15 07:14:05,615 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:14:05,615 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2022-04-15 07:14:05,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 07:14:05,615 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:05,615 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:05,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-15 07:14:05,616 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:05,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:05,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1511621185, now seen corresponding path program 24 times [2022-04-15 07:14:05,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:05,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527161222] [2022-04-15 07:14:09,851 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:09,889 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:14:09,984 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:14:10,010 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:10,010 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:10,054 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:14:14,116 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:14,160 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:14:14,253 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:14:14,278 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:14,278 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:14,319 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:14:16,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:14:16,520 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:14:16,546 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:16,546 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:16,578 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:14:20,646 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:20,689 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:14:20,780 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:14:20,805 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:20,805 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:20,838 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:14:22,907 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:22,954 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:14:23,045 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:14:23,243 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:23,244 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:23,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1833322667, now seen corresponding path program 1 times [2022-04-15 07:14:23,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:23,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139552741] [2022-04-15 07:14:23,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:23,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:23,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:23,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:23,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {14404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14398#true} is VALID [2022-04-15 07:14:23,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {14398#true} assume true; {14398#true} is VALID [2022-04-15 07:14:23,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14398#true} {14398#true} #92#return; {14398#true} is VALID [2022-04-15 07:14:23,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {14398#true} call ULTIMATE.init(); {14404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:23,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {14404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {14398#true} is VALID [2022-04-15 07:14:23,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {14398#true} assume true; {14398#true} is VALID [2022-04-15 07:14:23,271 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14398#true} {14398#true} #92#return; {14398#true} is VALID [2022-04-15 07:14:23,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {14398#true} call #t~ret10 := main(); {14398#true} is VALID [2022-04-15 07:14:23,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {14398#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {14403#(= main_~a~0 0)} is VALID [2022-04-15 07:14:23,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {14403#(= main_~a~0 0)} [152] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_384 v_main_~d~0_382)) (.cse1 (= |v_main_#t~pre5_172| |v_main_#t~pre5_171|)) (.cse2 (= v_main_~c~0_316 v_main_~c~0_314)) (.cse3 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse4 (= |v_main_#t~pre6_218| |v_main_#t~pre6_217|)) (.cse5 (= v_main_~b~0_239 v_main_~b~0_237)) (.cse6 (= v_main_~f~0_3723 v_main_~f~0_3698)) (.cse7 (= v_main_~e~0_1770 v_main_~e~0_1765)) (.cse8 (= |v_main_#t~pre9_2492| |v_main_#t~pre9_2471|)) (.cse9 (= |v_main_#t~pre7_257| |v_main_#t~pre7_256|)) (.cse10 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_1458| |v_main_#t~pre8_1462|) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_1462| |v_main_#t~pre8_1458|) .cse10))) InVars {main_~e~0=v_main_~e~0_1770, main_~d~0=v_main_~d~0_384, main_~b~0=v_main_~b~0_239, main_~f~0=v_main_~f~0_3723, main_#t~pre7=|v_main_#t~pre7_257|, main_~c~0=v_main_~c~0_316, main_#t~pre8=|v_main_#t~pre8_1462|, main_#t~pre9=|v_main_#t~pre9_2492|, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_172|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_218|} OutVars{main_~e~0=v_main_~e~0_1765, main_~d~0=v_main_~d~0_382, main_~b~0=v_main_~b~0_237, main_~f~0=v_main_~f~0_3698, main_#t~pre7=|v_main_#t~pre7_256|, main_~c~0=v_main_~c~0_314, main_#t~pre8=|v_main_#t~pre8_1458|, main_#t~pre9=|v_main_#t~pre9_2471|, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_171|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_217|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14403#(= main_~a~0 0)} is VALID [2022-04-15 07:14:23,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {14403#(= main_~a~0 0)} [151] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {14399#false} is VALID [2022-04-15 07:14:23,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {14399#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {14399#false} is VALID [2022-04-15 07:14:23,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {14399#false} assume !false; {14399#false} is VALID [2022-04-15 07:14:23,275 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:14:23,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:23,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139552741] [2022-04-15 07:14:23,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139552741] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:23,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:23,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:24,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:24,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527161222] [2022-04-15 07:14:24,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527161222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:24,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:24,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 07:14:24,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934985506] [2022-04-15 07:14:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:24,032 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:24,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:24,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:24,066 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:14:24,066 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 07:14:24,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:24,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 07:14:24,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=936, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 07:14:24,074 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:26,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:26,404 INFO L93 Difference]: Finished difference Result 126 states and 151 transitions. [2022-04-15 07:14:26,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 07:14:26,405 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:26,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 151 transitions. [2022-04-15 07:14:26,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:26,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 151 transitions. [2022-04-15 07:14:26,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 151 transitions. [2022-04-15 07:14:26,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:26,480 INFO L225 Difference]: With dead ends: 126 [2022-04-15 07:14:26,480 INFO L226 Difference]: Without dead ends: 111 [2022-04-15 07:14:26,481 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 35 SyntacticMatches, 9 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=552, Invalid=3608, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:14:26,481 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 183 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1684 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 1755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 1684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:26,481 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 75 Invalid, 1755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 1684 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 07:14:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-15 07:14:26,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 78. [2022-04-15 07:14:26,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:26,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:26,523 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:26,523 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:26,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:26,524 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-15 07:14:26,524 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-15 07:14:26,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:26,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:26,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 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:14:26,524 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 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:14:26,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:26,525 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-04-15 07:14:26,525 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-04-15 07:14:26,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:26,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:26,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:26,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:26,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0810810810810811) internal successors, (80), 74 states have internal predecessors, (80), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:26,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2022-04-15 07:14:26,526 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 75 [2022-04-15 07:14:26,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:26,526 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2022-04-15 07:14:26,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1176470588235294) internal successors, (72), 33 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:14:26,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 83 transitions. [2022-04-15 07:14:26,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:14:26,736 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2022-04-15 07:14:26,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 07:14:26,736 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:26,736 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:26,736 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-15 07:14:26,736 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:26,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:26,737 INFO L85 PathProgramCache]: Analyzing trace with hash 884822495, now seen corresponding path program 25 times [2022-04-15 07:14:26,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:26,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [435652291] [2022-04-15 07:14:26,940 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:14: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:14:27,184 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:14:27,227 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:14:27,323 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:14:27,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:14:27,495 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:14:27,522 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:14: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:14:27,654 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:14:27,755 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:14:27,782 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:14:27,849 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:14:27,906 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:14:28,007 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:14:28,035 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:14:28,107 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:14:28,182 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:14:28,330 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:28,330 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:28,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1833384171, now seen corresponding path program 1 times [2022-04-15 07:14:28,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:28,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256859269] [2022-04-15 07:14:28,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:28,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:28,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:28,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:28,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {15135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15129#true} is VALID [2022-04-15 07:14:28,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {15129#true} assume true; {15129#true} is VALID [2022-04-15 07:14:28,366 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15129#true} {15129#true} #92#return; {15129#true} is VALID [2022-04-15 07:14:28,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {15129#true} call ULTIMATE.init(); {15135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:28,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {15135#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15129#true} is VALID [2022-04-15 07:14:28,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {15129#true} assume true; {15129#true} is VALID [2022-04-15 07:14:28,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15129#true} {15129#true} #92#return; {15129#true} is VALID [2022-04-15 07:14:28,370 INFO L272 TraceCheckUtils]: 4: Hoare triple {15129#true} call #t~ret10 := main(); {15129#true} is VALID [2022-04-15 07:14:28,371 INFO L290 TraceCheckUtils]: 5: Hoare triple {15129#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {15134#(= main_~a~0 0)} is VALID [2022-04-15 07:14:28,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {15134#(= main_~a~0 0)} [154] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_225| |v_main_#t~pre6_224|)) (.cse1 (= v_main_~d~0_396 v_main_~d~0_394)) (.cse2 (= v_main_~b~0_247 v_main_~b~0_245)) (.cse3 (= v_main_~f~0_3966 v_main_~f~0_3940)) (.cse4 (= v_main_~a~0_184 v_main_~a~0_183)) (.cse5 (= |v_main_#t~pre9_2662| |v_main_#t~pre9_2640|)) (.cse6 (= |v_main_#t~pre5_178| |v_main_#t~pre5_177|)) (.cse7 (= v_main_~e~0_1870 v_main_~e~0_1865)) (.cse8 (= |v_main_#t~pre7_265| |v_main_#t~pre7_264|)) (.cse9 (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) (.cse10 (= v_main_~c~0_326 v_main_~c~0_324))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre8_1551| |v_main_#t~pre8_1547|) .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1547| |v_main_#t~pre8_1551|) .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_1870, main_~d~0=v_main_~d~0_396, main_~b~0=v_main_~b~0_247, main_~f~0=v_main_~f~0_3966, main_#t~pre7=|v_main_#t~pre7_265|, main_~c~0=v_main_~c~0_326, main_#t~pre8=|v_main_#t~pre8_1551|, main_#t~pre9=|v_main_#t~pre9_2662|, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_178|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_225|} OutVars{main_~e~0=v_main_~e~0_1865, main_~d~0=v_main_~d~0_394, main_~b~0=v_main_~b~0_245, main_~f~0=v_main_~f~0_3940, main_#t~pre7=|v_main_#t~pre7_264|, main_~c~0=v_main_~c~0_324, main_#t~pre8=|v_main_#t~pre8_1547|, main_#t~pre9=|v_main_#t~pre9_2640|, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_177|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_224|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15134#(= main_~a~0 0)} is VALID [2022-04-15 07:14:28,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {15134#(= main_~a~0 0)} [153] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15130#false} is VALID [2022-04-15 07:14:28,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {15130#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {15130#false} is VALID [2022-04-15 07:14:28,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {15130#false} assume !false; {15130#false} is VALID [2022-04-15 07:14:28,372 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:14:28,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:28,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256859269] [2022-04-15 07:14:28,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256859269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:28,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:28,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:29,327 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:29,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [435652291] [2022-04-15 07:14:29,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [435652291] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:29,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:29,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 07:14:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795495372] [2022-04-15 07:14:29,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:29,328 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:29,328 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:29,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:29,367 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:14:29,367 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 07:14:29,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:29,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 07:14:29,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=998, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 07:14:29,368 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:31,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:31,374 INFO L93 Difference]: Finished difference Result 128 states and 153 transitions. [2022-04-15 07:14:31,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 07:14:31,374 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:31,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:31,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 153 transitions. [2022-04-15 07:14:31,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 153 transitions. [2022-04-15 07:14:31,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 153 transitions. [2022-04-15 07:14:31,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:31,448 INFO L225 Difference]: With dead ends: 128 [2022-04-15 07:14:31,448 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 07:14:31,450 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 32 SyntacticMatches, 13 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=570, Invalid=3852, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:14:31,451 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 176 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1588 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 1660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:31,451 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 65 Invalid, 1660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1588 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 07:14:31,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 07:14:31,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 80. [2022-04-15 07:14:31,522 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:31,522 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:31,522 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:31,522 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:31,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:31,523 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-15 07:14:31,523 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-15 07:14:31,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:31,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:31,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 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 113 states. [2022-04-15 07:14:31,524 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 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 113 states. [2022-04-15 07:14:31,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:31,524 INFO L93 Difference]: Finished difference Result 113 states and 132 transitions. [2022-04-15 07:14:31,524 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 132 transitions. [2022-04-15 07:14:31,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:31,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:31,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:31,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0789473684210527) internal successors, (82), 76 states have internal predecessors, (82), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:31,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2022-04-15 07:14:31,525 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 77 [2022-04-15 07:14:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:31,526 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2022-04-15 07:14:31,526 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.1142857142857143) internal successors, (74), 34 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:14:31,526 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 85 transitions. [2022-04-15 07:14:31,708 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:14:31,709 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2022-04-15 07:14:31,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 07:14:31,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:31,709 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:31,709 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-15 07:14:31,710 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:31,710 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash -173297155, now seen corresponding path program 26 times [2022-04-15 07:14:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:31,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [397602569] [2022-04-15 07:14:35,836 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:35,886 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:14:35,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:14:36,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:14:36,001 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:36,034 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:14:38,984 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:39,043 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:14:39,135 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:14:39,160 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:39,160 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:39,195 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:14:41,269 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:41,322 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:14:41,424 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:14:41,449 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:41,449 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:41,489 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:14:45,563 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:45,615 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:14:45,704 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:14:45,744 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:14:45,744 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:14:45,776 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:14:49,849 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:49,900 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:14:49,988 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:14:50,223 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:14:50,224 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:14:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1833445675, now seen corresponding path program 1 times [2022-04-15 07:14:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:14:50,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783596906] [2022-04-15 07:14:50,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:14:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:14:50,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:50,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:14:50,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:14:50,254 INFO L290 TraceCheckUtils]: 0: Hoare triple {15881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15875#true} is VALID [2022-04-15 07:14:50,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {15875#true} assume true; {15875#true} is VALID [2022-04-15 07:14:50,254 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15875#true} {15875#true} #92#return; {15875#true} is VALID [2022-04-15 07:14:50,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {15875#true} call ULTIMATE.init(); {15881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:14:50,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {15881#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {15875#true} is VALID [2022-04-15 07:14:50,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {15875#true} assume true; {15875#true} is VALID [2022-04-15 07:14:50,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15875#true} {15875#true} #92#return; {15875#true} is VALID [2022-04-15 07:14:50,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {15875#true} call #t~ret10 := main(); {15875#true} is VALID [2022-04-15 07:14:50,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {15875#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {15880#(= main_~a~0 0)} is VALID [2022-04-15 07:14:50,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {15880#(= main_~a~0 0)} [156] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_2821| |v_main_#t~pre9_2798|)) (.cse1 (= v_main_~b~0_255 v_main_~b~0_253)) (.cse2 (= v_main_~d~0_408 v_main_~d~0_406)) (.cse3 (= |v_main_#t~pre7_273| |v_main_#t~pre7_272|)) (.cse4 (= v_main_~f~0_4199 v_main_~f~0_4172)) (.cse5 (= v_main_~c~0_336 v_main_~c~0_334)) (.cse6 (= |v_main_#t~pre6_232| |v_main_#t~pre6_231|)) (.cse7 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|))) (or (and (= |v_main_#t~pre5_184| |v_main_#t~pre5_183|) (= |v_main_#t~pre8_1624| |v_main_#t~pre8_1620|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~e~0_1958 v_main_~e~0_1953) .cse6 (= v_main_~a~0_190 v_main_~a~0_189) .cse7) (and (= |v_main_#t~pre8_1620| |v_main_#t~pre8_1624|) .cse0 (= |v_main_#t~pre5_183| |v_main_#t~pre5_184|) .cse1 (= v_main_~e~0_1953 v_main_~e~0_1958) .cse2 .cse3 (= v_main_~a~0_189 v_main_~a~0_190) .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_1958, main_~d~0=v_main_~d~0_408, main_~b~0=v_main_~b~0_255, main_~f~0=v_main_~f~0_4199, main_#t~pre7=|v_main_#t~pre7_273|, main_~c~0=v_main_~c~0_336, main_#t~pre8=|v_main_#t~pre8_1624|, main_#t~pre9=|v_main_#t~pre9_2821|, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_184|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_232|} OutVars{main_~e~0=v_main_~e~0_1953, main_~d~0=v_main_~d~0_406, main_~b~0=v_main_~b~0_253, main_~f~0=v_main_~f~0_4172, main_#t~pre7=|v_main_#t~pre7_272|, main_~c~0=v_main_~c~0_334, main_#t~pre8=|v_main_#t~pre8_1620|, main_#t~pre9=|v_main_#t~pre9_2798|, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_183|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_231|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15880#(= main_~a~0 0)} is VALID [2022-04-15 07:14:50,256 INFO L290 TraceCheckUtils]: 7: Hoare triple {15880#(= main_~a~0 0)} [155] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {15876#false} is VALID [2022-04-15 07:14:50,256 INFO L290 TraceCheckUtils]: 8: Hoare triple {15876#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {15876#false} is VALID [2022-04-15 07:14:50,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {15876#false} assume !false; {15876#false} is VALID [2022-04-15 07:14:50,256 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:14:50,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:14:50,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783596906] [2022-04-15 07:14:50,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783596906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:50,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:50,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:14:51,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:14:51,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [397602569] [2022-04-15 07:14:51,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [397602569] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:14:51,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:14:51,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 07:14:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165346136] [2022-04-15 07:14:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:14:51,380 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:51,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:14:51,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:51,434 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:14:51,435 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 07:14:51,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:51,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 07:14:51,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=1062, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 07:14:51,435 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:54,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:54,356 INFO L93 Difference]: Finished difference Result 132 states and 158 transitions. [2022-04-15 07:14:54,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 07:14:54,357 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:54,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:14:54,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 158 transitions. [2022-04-15 07:14:54,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:54,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 158 transitions. [2022-04-15 07:14:54,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 158 transitions. [2022-04-15 07:14:54,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:14:54,460 INFO L225 Difference]: With dead ends: 132 [2022-04-15 07:14:54,460 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 07:14:54,461 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 30 SyntacticMatches, 16 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 874 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=588, Invalid=4104, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 07:14:54,461 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 240 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 1617 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 1728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1617 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:14:54,461 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 25 Invalid, 1728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1617 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-15 07:14:54,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 07:14:54,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 84. [2022-04-15 07:14:54,506 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:14:54,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:54,507 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:54,507 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:54,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:54,508 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-15 07:14:54,508 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-15 07:14:54,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:54,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:54,508 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 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 117 states. [2022-04-15 07:14:54,508 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 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 117 states. [2022-04-15 07:14:54,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:14:54,509 INFO L93 Difference]: Finished difference Result 117 states and 136 transitions. [2022-04-15 07:14:54,509 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 136 transitions. [2022-04-15 07:14:54,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:14:54,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:14:54,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:14:54,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:14:54,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.075) internal successors, (86), 80 states have internal predecessors, (86), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:14:54,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2022-04-15 07:14:54,510 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 79 [2022-04-15 07:14:54,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:14:54,510 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2022-04-15 07:14:54,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.111111111111111) internal successors, (76), 35 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:14:54,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 89 transitions. [2022-04-15 07:14:54,726 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:14:54,726 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2022-04-15 07:14:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 07:14:54,727 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:14:54,727 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:14:54,727 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-15 07:14:54,727 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:14:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:14:54,727 INFO L85 PathProgramCache]: Analyzing trace with hash 880968347, now seen corresponding path program 27 times [2022-04-15 07:14:54,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:14:54,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [941605627] [2022-04-15 07:14:57,377 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:14:57,423 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:14:57,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:14:57,635 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:15:01,725 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:01,776 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:15:01,866 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:15:02,016 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:15:02,360 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:15:02,446 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:15:02,604 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:15:06,693 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:06,745 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:15:06,832 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:15:06,985 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:15:09,270 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:15:09,377 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:15:09,596 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:09,597 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:09,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1833507179, now seen corresponding path program 1 times [2022-04-15 07:15:09,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:09,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2136107455] [2022-04-15 07:15:09,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:09,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:09,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:09,620 INFO L290 TraceCheckUtils]: 0: Hoare triple {16654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16648#true} is VALID [2022-04-15 07:15:09,620 INFO L290 TraceCheckUtils]: 1: Hoare triple {16648#true} assume true; {16648#true} is VALID [2022-04-15 07:15:09,620 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16648#true} {16648#true} #92#return; {16648#true} is VALID [2022-04-15 07:15:09,621 INFO L272 TraceCheckUtils]: 0: Hoare triple {16648#true} call ULTIMATE.init(); {16654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:09,621 INFO L290 TraceCheckUtils]: 1: Hoare triple {16654#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {16648#true} is VALID [2022-04-15 07:15:09,621 INFO L290 TraceCheckUtils]: 2: Hoare triple {16648#true} assume true; {16648#true} is VALID [2022-04-15 07:15:09,621 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16648#true} {16648#true} #92#return; {16648#true} is VALID [2022-04-15 07:15:09,621 INFO L272 TraceCheckUtils]: 4: Hoare triple {16648#true} call #t~ret10 := main(); {16648#true} is VALID [2022-04-15 07:15:09,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {16648#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {16653#(= main_~a~0 0)} is VALID [2022-04-15 07:15:09,622 INFO L290 TraceCheckUtils]: 6: Hoare triple {16653#(= main_~a~0 0)} [158] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_239| |v_main_#t~pre6_238|)) (.cse1 (= v_main_~d~0_420 v_main_~d~0_418)) (.cse2 (= v_main_~e~0_2036 v_main_~e~0_2031)) (.cse3 (= |v_main_#t~pre5_190| |v_main_#t~pre5_189|)) (.cse4 (= v_main_~b~0_263 v_main_~b~0_261)) (.cse5 (= v_main_~c~0_346 v_main_~c~0_344)) (.cse6 (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|)) (.cse7 (= |v_main_#t~pre9_2975| |v_main_#t~pre9_2951|)) (.cse8 (= v_main_~a~0_196 v_main_~a~0_195)) (.cse9 (= v_main_~f~0_4427 v_main_~f~0_4399))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= |v_main_#t~pre7_280| |v_main_#t~pre7_281|) .cse6 .cse7 .cse8 (= |v_main_#t~pre8_1688| |v_main_#t~pre8_1692|) .cse9) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre8_1692| |v_main_#t~pre8_1688|) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre7_281| |v_main_#t~pre7_280|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2036, main_~d~0=v_main_~d~0_420, main_~b~0=v_main_~b~0_263, main_~f~0=v_main_~f~0_4427, main_#t~pre7=|v_main_#t~pre7_281|, main_~c~0=v_main_~c~0_346, main_#t~pre8=|v_main_#t~pre8_1692|, main_#t~pre9=|v_main_#t~pre9_2975|, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_190|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_239|} OutVars{main_~e~0=v_main_~e~0_2031, main_~d~0=v_main_~d~0_418, main_~b~0=v_main_~b~0_261, main_~f~0=v_main_~f~0_4399, main_#t~pre7=|v_main_#t~pre7_280|, main_~c~0=v_main_~c~0_344, main_#t~pre8=|v_main_#t~pre8_1688|, main_#t~pre9=|v_main_#t~pre9_2951|, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_189|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_238|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16653#(= main_~a~0 0)} is VALID [2022-04-15 07:15:09,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {16653#(= main_~a~0 0)} [157] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {16649#false} is VALID [2022-04-15 07:15:09,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {16649#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {16649#false} is VALID [2022-04-15 07:15:09,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {16649#false} assume !false; {16649#false} is VALID [2022-04-15 07:15:09,623 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:15:09,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:09,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2136107455] [2022-04-15 07:15:09,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2136107455] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:09,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:09,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:10,669 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:10,669 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [941605627] [2022-04-15 07:15:10,669 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [941605627] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:10,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:10,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 07:15:10,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293533858] [2022-04-15 07:15:10,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:10,669 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:10,670 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:10,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:10,708 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:15:10,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 07:15:10,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:10,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 07:15:10,708 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=1128, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 07:15:10,709 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:13,677 INFO L93 Difference]: Finished difference Result 133 states and 158 transitions. [2022-04-15 07:15:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 07:15:13,677 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:13,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:13,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 158 transitions. [2022-04-15 07:15:13,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:13,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 158 transitions. [2022-04-15 07:15:13,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 158 transitions. [2022-04-15 07:15:13,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:13,768 INFO L225 Difference]: With dead ends: 133 [2022-04-15 07:15:13,768 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 07:15:13,768 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=606, Invalid=4364, Unknown=0, NotChecked=0, Total=4970 [2022-04-15 07:15:13,769 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 228 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1919 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 2030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 1919 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:13,769 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 35 Invalid, 2030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 1919 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 07:15:13,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 07:15:13,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 86. [2022-04-15 07:15:13,836 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:13,836 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:13,836 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:13,836 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:13,837 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-15 07:15:13,837 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-15 07:15:13,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:13,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:13,838 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 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 118 states. [2022-04-15 07:15:13,838 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 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 118 states. [2022-04-15 07:15:13,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:13,839 INFO L93 Difference]: Finished difference Result 118 states and 137 transitions. [2022-04-15 07:15:13,839 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 137 transitions. [2022-04-15 07:15:13,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:13,840 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:13,840 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:13,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:13,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.0731707317073171) internal successors, (88), 82 states have internal predecessors, (88), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:13,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2022-04-15 07:15:13,841 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 81 [2022-04-15 07:15:13,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:13,841 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2022-04-15 07:15:13,841 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.108108108108108) internal successors, (78), 36 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:15:13,841 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 91 transitions. [2022-04-15 07:15:14,049 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:15:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-04-15 07:15:14,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-04-15 07:15:14,075 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:14,075 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:14,075 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-15 07:15:14,076 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:14,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:14,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1797419514, now seen corresponding path program 28 times [2022-04-15 07:15:14,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:14,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [638529906] [2022-04-15 07:15:18,276 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:18,313 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:15:18,396 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:15:18,560 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:15:18,598 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:15:22,649 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:22,694 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:15:22,787 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:15:22,945 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:15:22,985 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:15:27,051 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:27,096 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:15:27,186 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:15:27,345 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:15:27,382 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:15:31,439 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:31,483 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:15:31,574 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:15:31,731 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:15:31,771 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:15:35,836 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:35,882 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:15:35,974 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:15:36,201 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:36,201 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:36,202 INFO L85 PathProgramCache]: Analyzing trace with hash 1833568683, now seen corresponding path program 1 times [2022-04-15 07:15:36,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:36,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686853664] [2022-04-15 07:15:36,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:36,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:36,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:36,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:36,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {17438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {17432#true} assume true; {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17432#true} {17432#true} #92#return; {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {17432#true} call ULTIMATE.init(); {17438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:36,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {17438#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {17432#true} assume true; {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17432#true} {17432#true} #92#return; {17432#true} is VALID [2022-04-15 07:15:36,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {17432#true} call #t~ret10 := main(); {17432#true} is VALID [2022-04-15 07:15:36,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {17432#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {17437#(= main_~a~0 0)} is VALID [2022-04-15 07:15:36,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {17437#(= main_~a~0 0)} [160] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= |v_main_#t~pre5_196| |v_main_#t~pre5_195|)) (.cse2 (= |v_main_#t~pre9_3129| |v_main_#t~pre9_3105|)) (.cse3 (= v_main_~c~0_356 v_main_~c~0_354)) (.cse4 (= |v_main_#t~pre6_246| |v_main_#t~pre6_245|)) (.cse5 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse6 (= |v_main_#t~pre7_289| |v_main_#t~pre7_288|)) (.cse7 (= v_main_~d~0_432 v_main_~d~0_430)) (.cse8 (= v_main_~f~0_4681 v_main_~f~0_4652)) (.cse9 (= v_main_~e~0_2141 v_main_~e~0_2135)) (.cse10 (= |v_main_#t~pre8_1785| |v_main_#t~pre8_1780|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= v_main_~b~0_269 v_main_~b~0_271)) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~b~0_271 v_main_~b~0_269) .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_2141, main_~d~0=v_main_~d~0_432, main_~b~0=v_main_~b~0_271, main_~f~0=v_main_~f~0_4681, main_#t~pre7=|v_main_#t~pre7_289|, main_~c~0=v_main_~c~0_356, main_#t~pre8=|v_main_#t~pre8_1785|, main_#t~pre9=|v_main_#t~pre9_3129|, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_196|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_246|} OutVars{main_~e~0=v_main_~e~0_2135, main_~d~0=v_main_~d~0_430, main_~b~0=v_main_~b~0_269, main_~f~0=v_main_~f~0_4652, main_#t~pre7=|v_main_#t~pre7_288|, main_~c~0=v_main_~c~0_354, main_#t~pre8=|v_main_#t~pre8_1780|, main_#t~pre9=|v_main_#t~pre9_3105|, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_195|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_245|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17437#(= main_~a~0 0)} is VALID [2022-04-15 07:15:36,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {17437#(= main_~a~0 0)} [159] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {17433#false} is VALID [2022-04-15 07:15:36,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {17433#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {17433#false} is VALID [2022-04-15 07:15:36,229 INFO L290 TraceCheckUtils]: 9: Hoare triple {17433#false} assume !false; {17433#false} is VALID [2022-04-15 07:15:36,229 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:15:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:36,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686853664] [2022-04-15 07:15:36,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1686853664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:36,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:36,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:37,160 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:37,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [638529906] [2022-04-15 07:15:37,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [638529906] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:37,160 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:37,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 07:15:37,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783336333] [2022-04-15 07:15:37,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:37,161 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 07:15:37,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:37,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:37,201 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:15:37,201 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 07:15:37,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:37,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 07:15:37,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=1196, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 07:15:37,201 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:39,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:39,671 INFO L93 Difference]: Finished difference Result 135 states and 160 transitions. [2022-04-15 07:15:39,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 07:15:39,672 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 84 [2022-04-15 07:15:39,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:15:39,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-15 07:15:39,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:39,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 160 transitions. [2022-04-15 07:15:39,673 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 160 transitions. [2022-04-15 07:15:39,751 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:15:39,752 INFO L225 Difference]: With dead ends: 135 [2022-04-15 07:15:39,752 INFO L226 Difference]: Without dead ends: 120 [2022-04-15 07:15:39,752 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 18 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 981 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=624, Invalid=4632, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 07:15:39,753 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 236 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 2085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:15:39,753 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 75 Invalid, 2085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-15 07:15:39,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-15 07:15:39,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 87. [2022-04-15 07:15:39,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:15:39,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:39,797 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:39,798 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:39,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:39,799 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2022-04-15 07:15:39,799 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-04-15 07:15:39,799 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:39,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:39,799 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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 120 states. [2022-04-15 07:15:39,799 INFO L87 Difference]: Start difference. First operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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 120 states. [2022-04-15 07:15:39,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:15:39,800 INFO L93 Difference]: Finished difference Result 120 states and 139 transitions. [2022-04-15 07:15:39,800 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 139 transitions. [2022-04-15 07:15:39,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:15:39,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:15:39,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:15:39,800 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:15:39,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 83 states have (on average 1.072289156626506) internal successors, (89), 83 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:15:39,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 92 transitions. [2022-04-15 07:15:39,801 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 92 transitions. Word has length 84 [2022-04-15 07:15:39,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:15:39,801 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 92 transitions. [2022-04-15 07:15:39,801 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:39,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 92 transitions. [2022-04-15 07:15:40,014 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:15:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 92 transitions. [2022-04-15 07:15:40,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 07:15:40,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:15:40,014 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:15:40,015 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-15 07:15:40,015 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:15:40,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:15:40,021 INFO L85 PathProgramCache]: Analyzing trace with hash 659109720, now seen corresponding path program 29 times [2022-04-15 07:15:40,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:40,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1805399097] [2022-04-15 07:15:40,241 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:15:40,302 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:15:44,374 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:44,422 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:15:44,457 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:15:44,537 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:15:44,626 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:15:47,288 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:47,346 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:15:47,391 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:15:47,484 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:15:47,574 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:15:51,671 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:51,723 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:15:51,762 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:15:51,845 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:15:51,925 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:15:56,032 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:15:56,090 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:15:56,135 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:15:56,227 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:15:56,318 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:15:56,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:15:56,511 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:15:56,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1833630187, now seen corresponding path program 1 times [2022-04-15 07:15:56,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:15:56,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407034707] [2022-04-15 07:15:56,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:15:56,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:15:56,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:15:56,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:15:56,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {18235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {18229#true} assume true; {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18229#true} {18229#true} #92#return; {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L272 TraceCheckUtils]: 0: Hoare triple {18229#true} call ULTIMATE.init(); {18235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:15:56,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {18235#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {18229#true} assume true; {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18229#true} {18229#true} #92#return; {18229#true} is VALID [2022-04-15 07:15:56,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {18229#true} call #t~ret10 := main(); {18229#true} is VALID [2022-04-15 07:15:56,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {18229#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {18234#(= main_~a~0 0)} is VALID [2022-04-15 07:15:56,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {18234#(= main_~a~0 0)} [162] L23-3-->L23-4_primed: Formula: (and (= v_main_~b~0_279 v_main_~b~0_277) (= v_main_~d~0_444 v_main_~d~0_442) (= v_main_~e~0_2246 v_main_~e~0_2240) (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|) (= v_main_~a~0_208 v_main_~a~0_207) (= |v_main_#t~pre5_202| |v_main_#t~pre5_201|) (= |v_main_#t~pre7_297| |v_main_#t~pre7_296|) (= |v_main_#t~pre9_3308| |v_main_#t~pre9_3283|) (= v_main_~f~0_4941 v_main_~f~0_4911) (= v_main_~c~0_366 v_main_~c~0_364) (= |v_main_#t~pre8_1878| |v_main_#t~pre8_1873|) (= |v_main_#t~pre6_253| |v_main_#t~pre6_252|)) InVars {main_~e~0=v_main_~e~0_2246, main_~d~0=v_main_~d~0_444, main_~b~0=v_main_~b~0_279, main_~f~0=v_main_~f~0_4941, main_#t~pre7=|v_main_#t~pre7_297|, main_~c~0=v_main_~c~0_366, main_#t~pre8=|v_main_#t~pre8_1878|, main_#t~pre9=|v_main_#t~pre9_3308|, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_202|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_253|} OutVars{main_~e~0=v_main_~e~0_2240, main_~d~0=v_main_~d~0_442, main_~b~0=v_main_~b~0_277, main_~f~0=v_main_~f~0_4911, main_#t~pre7=|v_main_#t~pre7_296|, main_~c~0=v_main_~c~0_364, main_#t~pre8=|v_main_#t~pre8_1873|, main_#t~pre9=|v_main_#t~pre9_3283|, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_252|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18234#(= main_~a~0 0)} is VALID [2022-04-15 07:15:56,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {18234#(= main_~a~0 0)} [161] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {18230#false} is VALID [2022-04-15 07:15:56,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {18230#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {18230#false} is VALID [2022-04-15 07:15:56,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {18230#false} assume !false; {18230#false} is VALID [2022-04-15 07:15:56,540 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:15:56,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:15:56,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407034707] [2022-04-15 07:15:56,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407034707] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:56,540 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:56,540 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:15:57,428 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:15:57,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1805399097] [2022-04-15 07:15:57,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1805399097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:15:57,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:15:57,428 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 07:15:57,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265708018] [2022-04-15 07:15:57,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:15:57,429 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 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 86 [2022-04-15 07:15:57,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:15:57,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:15:57,490 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:15:57,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 07:15:57,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:15:57,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 07:15:57,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=1266, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 07:15:57,490 INFO L87 Difference]: Start difference. First operand 87 states and 92 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:00,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,655 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-04-15 07:16:00,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 07:16:00,655 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 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 86 [2022-04-15 07:16:00,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 162 transitions. [2022-04-15 07:16:00,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:00,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 162 transitions. [2022-04-15 07:16:00,657 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 162 transitions. [2022-04-15 07:16:00,736 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:16:00,738 INFO L225 Difference]: With dead ends: 137 [2022-04-15 07:16:00,738 INFO L226 Difference]: Without dead ends: 122 [2022-04-15 07:16:00,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 987 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=642, Invalid=4908, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 07:16:00,738 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 224 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 2342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:00,739 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 55 Invalid, 2342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-15 07:16:00,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-04-15 07:16:00,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 89. [2022-04-15 07:16:00,790 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:00,791 INFO L82 GeneralOperation]: Start isEquivalent. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:00,791 INFO L74 IsIncluded]: Start isIncluded. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:00,791 INFO L87 Difference]: Start difference. First operand 122 states. Second operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:00,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,792 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-15 07:16:00,792 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-15 07:16:00,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:00,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:00,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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 122 states. [2022-04-15 07:16:00,792 INFO L87 Difference]: Start difference. First operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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 122 states. [2022-04-15 07:16:00,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:00,793 INFO L93 Difference]: Finished difference Result 122 states and 141 transitions. [2022-04-15 07:16:00,793 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 141 transitions. [2022-04-15 07:16:00,793 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:00,793 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:00,793 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:00,793 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 85 states have (on average 1.0705882352941176) internal successors, (91), 85 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:16:00,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2022-04-15 07:16:00,794 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 86 [2022-04-15 07:16:00,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:00,794 INFO L478 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2022-04-15 07:16:00,794 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:00,795 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 89 states and 94 transitions. [2022-04-15 07:16:01,013 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:16:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2022-04-15 07:16:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-15 07:16:01,014 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:01,014 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:01,014 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-15 07:16:01,014 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:01,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1960058166, now seen corresponding path program 30 times [2022-04-15 07:16:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:01,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2094060736] [2022-04-15 07:16:05,249 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:05,287 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:16:05,364 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:16:05,492 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:16:05,569 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:16:07,746 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:16:07,851 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:16:07,987 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:16:08,018 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:16:10,959 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:11,003 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:16:11,089 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:16:11,240 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:16:11,281 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:16:15,344 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:15,388 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:16:15,476 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:16:15,627 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:16:15,669 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:16:19,736 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:19,779 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:16:19,865 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:16:20,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:20,081 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:20,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1833691691, now seen corresponding path program 1 times [2022-04-15 07:16:20,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:20,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400657204] [2022-04-15 07:16:20,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:20,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:20,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:20,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {19047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19041#true} is VALID [2022-04-15 07:16:20,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {19041#true} assume true; {19041#true} is VALID [2022-04-15 07:16:20,105 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19041#true} {19041#true} #92#return; {19041#true} is VALID [2022-04-15 07:16:20,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {19041#true} call ULTIMATE.init(); {19047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:20,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {19047#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19041#true} is VALID [2022-04-15 07:16:20,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {19041#true} assume true; {19041#true} is VALID [2022-04-15 07:16:20,106 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19041#true} {19041#true} #92#return; {19041#true} is VALID [2022-04-15 07:16:20,106 INFO L272 TraceCheckUtils]: 4: Hoare triple {19041#true} call #t~ret10 := main(); {19041#true} is VALID [2022-04-15 07:16:20,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {19041#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {19046#(= main_~a~0 0)} is VALID [2022-04-15 07:16:20,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {19046#(= main_~a~0 0)} [164] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_5207 v_main_~f~0_5176)) (.cse1 (= v_main_~d~0_456 v_main_~d~0_454)) (.cse2 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse3 (= v_main_~b~0_287 v_main_~b~0_285)) (.cse4 (= |v_main_#t~pre7_305| |v_main_#t~pre7_304|)) (.cse5 (= v_main_~c~0_376 v_main_~c~0_374)) (.cse6 (= |v_main_#t~pre9_3492| |v_main_#t~pre9_3466|)) (.cse7 (= |v_main_#t~pre5_208| |v_main_#t~pre5_207|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_1971| |v_main_#t~pre8_1966|) .cse5 .cse6 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|) (= v_main_~e~0_2351 v_main_~e~0_2345) .cse7 (= |v_main_#t~pre6_260| |v_main_#t~pre6_259|)) (and (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_259| |v_main_#t~pre6_260|) .cse3 .cse4 .cse5 .cse6 (= v_main_~e~0_2345 v_main_~e~0_2351) .cse7 (= |v_main_#t~pre8_1966| |v_main_#t~pre8_1971|)))) InVars {main_~e~0=v_main_~e~0_2351, main_~d~0=v_main_~d~0_456, main_~b~0=v_main_~b~0_287, main_~f~0=v_main_~f~0_5207, main_#t~pre7=|v_main_#t~pre7_305|, main_~c~0=v_main_~c~0_376, main_#t~pre8=|v_main_#t~pre8_1971|, main_#t~pre9=|v_main_#t~pre9_3492|, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_208|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_260|} OutVars{main_~e~0=v_main_~e~0_2345, main_~d~0=v_main_~d~0_454, main_~b~0=v_main_~b~0_285, main_~f~0=v_main_~f~0_5176, main_#t~pre7=|v_main_#t~pre7_304|, main_~c~0=v_main_~c~0_374, main_#t~pre8=|v_main_#t~pre8_1966|, main_#t~pre9=|v_main_#t~pre9_3466|, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_207|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_259|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19046#(= main_~a~0 0)} is VALID [2022-04-15 07:16:20,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {19046#(= main_~a~0 0)} [163] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19042#false} is VALID [2022-04-15 07:16:20,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {19042#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {19042#false} is VALID [2022-04-15 07:16:20,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {19042#false} assume !false; {19042#false} is VALID [2022-04-15 07:16:20,107 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:16:20,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:20,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400657204] [2022-04-15 07:16:20,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400657204] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:20,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:20,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:21,392 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:21,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2094060736] [2022-04-15 07:16:21,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2094060736] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:21,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:21,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 07:16:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868411714] [2022-04-15 07:16:21,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:21,392 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 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 88 [2022-04-15 07:16:21,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:21,393 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:21,453 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:16:21,453 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 07:16:21,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:21,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 07:16:21,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1338, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 07:16:21,453 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:24,752 INFO L93 Difference]: Finished difference Result 139 states and 164 transitions. [2022-04-15 07:16:24,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 07:16:24,752 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 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 88 [2022-04-15 07:16:24,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:24,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 164 transitions. [2022-04-15 07:16:24,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 164 transitions. [2022-04-15 07:16:24,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 164 transitions. [2022-04-15 07:16:24,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:24,856 INFO L225 Difference]: With dead ends: 139 [2022-04-15 07:16:24,856 INFO L226 Difference]: Without dead ends: 124 [2022-04-15 07:16:24,857 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 36 SyntacticMatches, 15 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1071 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=660, Invalid=5192, Unknown=0, NotChecked=0, Total=5852 [2022-04-15 07:16:24,857 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 250 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 2066 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 2203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 2066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:24,857 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 40 Invalid, 2203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 2066 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-15 07:16:24,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-04-15 07:16:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 91. [2022-04-15 07:16:24,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:24,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,907 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,907 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:24,908 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-04-15 07:16:24,908 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-04-15 07:16:24,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:24,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:24,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 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 124 states. [2022-04-15 07:16:24,908 INFO L87 Difference]: Start difference. First operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 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 124 states. [2022-04-15 07:16:24,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:24,909 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-04-15 07:16:24,909 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-04-15 07:16:24,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:24,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:24,910 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:24,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:24,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 87 states have (on average 1.0689655172413792) internal successors, (93), 87 states have internal predecessors, (93), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 96 transitions. [2022-04-15 07:16:24,910 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 96 transitions. Word has length 88 [2022-04-15 07:16:24,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:24,911 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 96 transitions. [2022-04-15 07:16:24,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:24,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 96 transitions. [2022-04-15 07:16:25,158 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:16:25,159 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 96 transitions. [2022-04-15 07:16:25,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 07:16:25,159 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:25,159 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:25,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-15 07:16:25,159 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:25,159 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:25,159 INFO L85 PathProgramCache]: Analyzing trace with hash -1958935660, now seen corresponding path program 31 times [2022-04-15 07:16:25,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:25,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448164189] [2022-04-15 07:16:28,489 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:28,533 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:16:28,622 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:16:28,647 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:28,647 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:28,680 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:16:32,748 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:32,792 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:16:32,878 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:16:32,903 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:32,904 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:32,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:16:33,134 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:16:33,221 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:16:33,246 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:33,246 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:33,279 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:16:37,348 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:37,393 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:16:37,483 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:16:37,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:37,508 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:37,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:16:41,625 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:41,670 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:16:41,757 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:16:41,974 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:16:41,974 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:16:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1833753195, now seen corresponding path program 1 times [2022-04-15 07:16:41,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:16:41,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337481335] [2022-04-15 07:16:41,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:16:41,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:16:41,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:41,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:16:41,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:16:42,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {19874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19868#true} is VALID [2022-04-15 07:16:42,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {19868#true} assume true; {19868#true} is VALID [2022-04-15 07:16:42,002 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19868#true} {19868#true} #92#return; {19868#true} is VALID [2022-04-15 07:16:42,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {19868#true} call ULTIMATE.init(); {19874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:16:42,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {19874#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {19868#true} is VALID [2022-04-15 07:16:42,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {19868#true} assume true; {19868#true} is VALID [2022-04-15 07:16:42,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19868#true} {19868#true} #92#return; {19868#true} is VALID [2022-04-15 07:16:42,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {19868#true} call #t~ret10 := main(); {19868#true} is VALID [2022-04-15 07:16:42,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {19868#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {19873#(= main_~a~0 0)} is VALID [2022-04-15 07:16:42,005 INFO L290 TraceCheckUtils]: 6: Hoare triple {19873#(= main_~a~0 0)} [166] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_214| |v_main_#t~pre5_213|) (= v_main_~f~0_5463 v_main_~f~0_5431) (= v_main_~d~0_468 v_main_~d~0_466) (= v_main_~e~0_2444 v_main_~e~0_2438) (= |v_main_#t~pre8_2048| |v_main_#t~pre8_2043|) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= |v_main_#t~pre7_313| |v_main_#t~pre7_312|) (= v_main_~c~0_386 v_main_~c~0_384) (= |v_main_#t~pre9_3665| |v_main_#t~pre9_3638|) (= v_main_~a~0_220 v_main_~a~0_219) (= v_main_~b~0_295 v_main_~b~0_293) (= |v_main_#t~pre6_267| |v_main_#t~pre6_266|)) InVars {main_~e~0=v_main_~e~0_2444, main_~d~0=v_main_~d~0_468, main_~b~0=v_main_~b~0_295, main_~f~0=v_main_~f~0_5463, main_#t~pre7=|v_main_#t~pre7_313|, main_~c~0=v_main_~c~0_386, main_#t~pre8=|v_main_#t~pre8_2048|, main_#t~pre9=|v_main_#t~pre9_3665|, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_214|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_267|} OutVars{main_~e~0=v_main_~e~0_2438, main_~d~0=v_main_~d~0_466, main_~b~0=v_main_~b~0_293, main_~f~0=v_main_~f~0_5431, main_#t~pre7=|v_main_#t~pre7_312|, main_~c~0=v_main_~c~0_384, main_#t~pre8=|v_main_#t~pre8_2043|, main_#t~pre9=|v_main_#t~pre9_3638|, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_213|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_266|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19873#(= main_~a~0 0)} is VALID [2022-04-15 07:16:42,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {19873#(= main_~a~0 0)} [165] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {19869#false} is VALID [2022-04-15 07:16:42,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {19869#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {19869#false} is VALID [2022-04-15 07:16:42,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {19869#false} assume !false; {19869#false} is VALID [2022-04-15 07:16:42,005 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:16:42,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:16:42,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337481335] [2022-04-15 07:16:42,006 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337481335] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:42,006 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:42,006 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:16:43,351 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:16:43,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448164189] [2022-04-15 07:16:43,351 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448164189] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:16:43,351 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:16:43,351 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 07:16:43,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102385071] [2022-04-15 07:16:43,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:16:43,351 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:43,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:16:43,352 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:43,416 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:16:43,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 07:16:43,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:43,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 07:16:43,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1412, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 07:16:43,417 INFO L87 Difference]: Start difference. First operand 91 states and 96 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:47,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:47,480 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2022-04-15 07:16:47,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 07:16:47,480 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:47,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:16:47,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:47,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-15 07:16:47,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:47,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 166 transitions. [2022-04-15 07:16:47,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 166 transitions. [2022-04-15 07:16:47,569 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:16:47,574 INFO L225 Difference]: With dead ends: 141 [2022-04-15 07:16:47,574 INFO L226 Difference]: Without dead ends: 126 [2022-04-15 07:16:47,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 38 SyntacticMatches, 14 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1107 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=678, Invalid=5484, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 07:16:47,575 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 228 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2359 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:16:47,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [228 Valid, 45 Invalid, 2481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2359 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 07:16:47,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-04-15 07:16:47,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 93. [2022-04-15 07:16:47,627 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:16:47,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:47,628 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:47,628 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:47,629 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-04-15 07:16:47,629 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2022-04-15 07:16:47,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:47,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:47,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 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 126 states. [2022-04-15 07:16:47,629 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 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 126 states. [2022-04-15 07:16:47,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:16:47,630 INFO L93 Difference]: Finished difference Result 126 states and 145 transitions. [2022-04-15 07:16:47,630 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 145 transitions. [2022-04-15 07:16:47,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:16:47,631 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:16:47,631 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:16:47,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:16:47,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0674157303370786) internal successors, (95), 89 states have internal predecessors, (95), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:16:47,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 98 transitions. [2022-04-15 07:16:47,632 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 98 transitions. Word has length 90 [2022-04-15 07:16:47,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:16:47,632 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 98 transitions. [2022-04-15 07:16:47,632 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 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:16:47,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 98 transitions. [2022-04-15 07:16:47,889 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:16:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 98 transitions. [2022-04-15 07:16:47,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-15 07:16:47,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:16:47,890 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:16:47,890 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-15 07:16:47,890 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:16:47,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:16:47,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1425683854, now seen corresponding path program 32 times [2022-04-15 07:16:47,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:16:47,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [188796460] [2022-04-15 07:16:52,088 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:52,137 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:16:52,213 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:16:52,232 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:52,233 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:52,260 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:16:52,582 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:16:52,662 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:16:52,682 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:52,682 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:52,710 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:16:56,778 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:16:56,824 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:16:56,903 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:16:56,925 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:16:56,925 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:16:56,954 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:17:01,024 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:01,078 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:17:01,176 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:17:01,202 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:01,202 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:01,236 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:17:04,184 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:04,236 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:17:04,327 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:17:04,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:04,543 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:04,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1833814699, now seen corresponding path program 1 times [2022-04-15 07:17:04,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:04,546 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690372277] [2022-04-15 07:17:04,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:04,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:04,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:04,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:04,570 INFO L290 TraceCheckUtils]: 0: Hoare triple {20716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20710#true} is VALID [2022-04-15 07:17:04,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {20710#true} assume true; {20710#true} is VALID [2022-04-15 07:17:04,570 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20710#true} {20710#true} #92#return; {20710#true} is VALID [2022-04-15 07:17:04,571 INFO L272 TraceCheckUtils]: 0: Hoare triple {20710#true} call ULTIMATE.init(); {20716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:04,571 INFO L290 TraceCheckUtils]: 1: Hoare triple {20716#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {20710#true} is VALID [2022-04-15 07:17:04,571 INFO L290 TraceCheckUtils]: 2: Hoare triple {20710#true} assume true; {20710#true} is VALID [2022-04-15 07:17:04,571 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20710#true} {20710#true} #92#return; {20710#true} is VALID [2022-04-15 07:17:04,571 INFO L272 TraceCheckUtils]: 4: Hoare triple {20710#true} call #t~ret10 := main(); {20710#true} is VALID [2022-04-15 07:17:04,571 INFO L290 TraceCheckUtils]: 5: Hoare triple {20710#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {20715#(= main_~a~0 0)} is VALID [2022-04-15 07:17:04,572 INFO L290 TraceCheckUtils]: 6: Hoare triple {20715#(= main_~a~0 0)} [168] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= v_main_~f~0_5725 v_main_~f~0_5692)) (.cse2 (= v_main_~d~0_480 v_main_~d~0_478)) (.cse3 (= |v_main_#t~pre8_2125| |v_main_#t~pre8_2120|)) (.cse4 (= |v_main_#t~pre7_321| |v_main_#t~pre7_320|)) (.cse5 (= |v_main_#t~pre6_274| |v_main_#t~pre6_273|)) (.cse6 (= |v_main_#t~pre9_3843| |v_main_#t~pre9_3815|)) (.cse7 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse8 (= v_main_~b~0_303 v_main_~b~0_301)) (.cse9 (= v_main_~c~0_396 v_main_~c~0_394))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_220| |v_main_#t~pre5_219|) .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_2537 v_main_~e~0_2531) .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_219| |v_main_#t~pre5_220|) .cse5 (= v_main_~e~0_2531 v_main_~e~0_2537) .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2537, main_~d~0=v_main_~d~0_480, main_~b~0=v_main_~b~0_303, main_~f~0=v_main_~f~0_5725, main_#t~pre7=|v_main_#t~pre7_321|, main_~c~0=v_main_~c~0_396, main_#t~pre8=|v_main_#t~pre8_2125|, main_#t~pre9=|v_main_#t~pre9_3843|, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_220|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_274|} OutVars{main_~e~0=v_main_~e~0_2531, main_~d~0=v_main_~d~0_478, main_~b~0=v_main_~b~0_301, main_~f~0=v_main_~f~0_5692, main_#t~pre7=|v_main_#t~pre7_320|, main_~c~0=v_main_~c~0_394, main_#t~pre8=|v_main_#t~pre8_2120|, main_#t~pre9=|v_main_#t~pre9_3815|, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_219|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_273|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20715#(= main_~a~0 0)} is VALID [2022-04-15 07:17:04,572 INFO L290 TraceCheckUtils]: 7: Hoare triple {20715#(= main_~a~0 0)} [167] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {20711#false} is VALID [2022-04-15 07:17:04,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {20711#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {20711#false} is VALID [2022-04-15 07:17:04,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {20711#false} assume !false; {20711#false} is VALID [2022-04-15 07:17:04,573 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:17:04,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:04,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690372277] [2022-04-15 07:17:04,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690372277] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:04,573 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:04,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:05,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:05,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [188796460] [2022-04-15 07:17:05,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [188796460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:05,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:05,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 07:17:05,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705235581] [2022-04-15 07:17:05,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:05,897 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:05,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:05,897 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:06,015 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:17:06,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 07:17:06,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:06,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 07:17:06,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=1488, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 07:17:06,016 INFO L87 Difference]: Start difference. First operand 93 states and 98 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:09,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:09,479 INFO L93 Difference]: Finished difference Result 143 states and 168 transitions. [2022-04-15 07:17:09,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 07:17:09,479 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:09,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:09,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:09,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 168 transitions. [2022-04-15 07:17:09,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:09,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 168 transitions. [2022-04-15 07:17:09,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 168 transitions. [2022-04-15 07:17:09,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:09,579 INFO L225 Difference]: With dead ends: 143 [2022-04-15 07:17:09,580 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 07:17:09,580 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 34 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1200 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=696, Invalid=5784, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 07:17:09,581 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 200 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 2552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:09,581 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 45 Invalid, 2552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-15 07:17:09,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 07:17:09,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 95. [2022-04-15 07:17:09,655 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:09,656 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:09,656 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:09,656 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:09,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:09,657 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-15 07:17:09,657 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2022-04-15 07:17:09,657 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:09,657 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:09,657 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 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 128 states. [2022-04-15 07:17:09,657 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 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 128 states. [2022-04-15 07:17:09,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:09,658 INFO L93 Difference]: Finished difference Result 128 states and 147 transitions. [2022-04-15 07:17:09,658 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 147 transitions. [2022-04-15 07:17:09,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:09,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:09,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:09,659 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:09,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.065934065934066) internal successors, (97), 91 states have internal predecessors, (97), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:09,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 100 transitions. [2022-04-15 07:17:09,659 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 100 transitions. Word has length 92 [2022-04-15 07:17:09,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:09,660 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 100 transitions. [2022-04-15 07:17:09,660 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 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:17:09,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 100 transitions. [2022-04-15 07:17:09,917 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:17:09,917 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 100 transitions. [2022-04-15 07:17:09,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 07:17:09,918 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:09,918 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:09,918 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-15 07:17:09,918 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:09,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:09,918 INFO L85 PathProgramCache]: Analyzing trace with hash -71806512, now seen corresponding path program 33 times [2022-04-15 07:17:09,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:09,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [3389051] [2022-04-15 07:17:10,223 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:17:10,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:17:10,336 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:10,336 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:10,368 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:17:10,459 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:17:10,517 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:17:10,535 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:10,535 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:10,556 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:17:10,628 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:17:10,687 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:17:10,704 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:10,704 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:10,725 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:17:10,797 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:17:10,856 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:17:10,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:10,872 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:10,893 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:17:10,964 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:17:11,024 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:17:11,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:11,218 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:11,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1833876203, now seen corresponding path program 1 times [2022-04-15 07:17:11,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:11,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905973347] [2022-04-15 07:17:11,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:11,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:11,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:11,263 INFO L290 TraceCheckUtils]: 0: Hoare triple {21573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {21567#true} assume true; {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21567#true} {21567#true} #92#return; {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L272 TraceCheckUtils]: 0: Hoare triple {21567#true} call ULTIMATE.init(); {21573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:11,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {21573#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L290 TraceCheckUtils]: 2: Hoare triple {21567#true} assume true; {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21567#true} {21567#true} #92#return; {21567#true} is VALID [2022-04-15 07:17:11,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {21567#true} call #t~ret10 := main(); {21567#true} is VALID [2022-04-15 07:17:11,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {21567#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {21572#(= main_~a~0 0)} is VALID [2022-04-15 07:17:11,265 INFO L290 TraceCheckUtils]: 6: Hoare triple {21572#(= main_~a~0 0)} [170] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_5993 v_main_~f~0_5959)) (.cse1 (= |v_main_#t~pre8_2202| |v_main_#t~pre8_2197|)) (.cse2 (= |v_main_#t~pre5_226| |v_main_#t~pre5_225|)) (.cse3 (= |v_main_#t~pre6_281| |v_main_#t~pre6_280|)) (.cse4 (= |v_main_#t~pre7_329| |v_main_#t~pre7_328|)) (.cse5 (= v_main_~d~0_492 v_main_~d~0_490)) (.cse6 (= v_main_~a~0_232 v_main_~a~0_231)) (.cse7 (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|)) (.cse8 (= v_main_~c~0_406 v_main_~c~0_404))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre9_3997| |v_main_#t~pre9_4026|) .cse5 .cse6 .cse7 .cse8 (= v_main_~b~0_309 v_main_~b~0_311) (= v_main_~e~0_2624 v_main_~e~0_2630)) (and (= v_main_~b~0_311 v_main_~b~0_309) .cse0 (= |v_main_#t~pre9_4026| |v_main_#t~pre9_3997|) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~e~0_2630 v_main_~e~0_2624)))) InVars {main_~e~0=v_main_~e~0_2630, main_~d~0=v_main_~d~0_492, main_~b~0=v_main_~b~0_311, main_~f~0=v_main_~f~0_5993, main_#t~pre7=|v_main_#t~pre7_329|, main_~c~0=v_main_~c~0_406, main_#t~pre8=|v_main_#t~pre8_2202|, main_#t~pre9=|v_main_#t~pre9_4026|, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_226|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_281|} OutVars{main_~e~0=v_main_~e~0_2624, main_~d~0=v_main_~d~0_490, main_~b~0=v_main_~b~0_309, main_~f~0=v_main_~f~0_5959, main_#t~pre7=|v_main_#t~pre7_328|, main_~c~0=v_main_~c~0_404, main_#t~pre8=|v_main_#t~pre8_2197|, main_#t~pre9=|v_main_#t~pre9_3997|, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_280|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {21572#(= main_~a~0 0)} is VALID [2022-04-15 07:17:11,265 INFO L290 TraceCheckUtils]: 7: Hoare triple {21572#(= main_~a~0 0)} [169] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {21568#false} is VALID [2022-04-15 07:17:11,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {21568#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {21568#false} is VALID [2022-04-15 07:17:11,266 INFO L290 TraceCheckUtils]: 9: Hoare triple {21568#false} assume !false; {21568#false} is VALID [2022-04-15 07:17:11,266 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:17:11,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:11,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905973347] [2022-04-15 07:17:11,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905973347] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:11,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:11,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:12,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:12,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [3389051] [2022-04-15 07:17:12,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [3389051] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:12,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:12,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 07:17:12,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685914460] [2022-04-15 07:17:12,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:12,608 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:12,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:12,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:12,675 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:17:12,675 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 07:17:12,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:12,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 07:17:12,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=240, Invalid=1566, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 07:17:12,676 INFO L87 Difference]: Start difference. First operand 95 states and 100 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:16,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:16,881 INFO L93 Difference]: Finished difference Result 147 states and 173 transitions. [2022-04-15 07:17:16,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 07:17:16,881 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:16,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:16,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:16,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 173 transitions. [2022-04-15 07:17:16,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:16,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 173 transitions. [2022-04-15 07:17:16,884 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 173 transitions. [2022-04-15 07:17:16,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:16,968 INFO L225 Difference]: With dead ends: 147 [2022-04-15 07:17:16,968 INFO L226 Difference]: Without dead ends: 132 [2022-04-15 07:17:16,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 34 SyntacticMatches, 20 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1259 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=714, Invalid=6092, Unknown=0, NotChecked=0, Total=6806 [2022-04-15 07:17:16,975 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 2720 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 2848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 2720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:16,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 50 Invalid, 2848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 2720 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-15 07:17:16,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-04-15 07:17:17,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 99. [2022-04-15 07:17:17,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:17,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:17,046 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:17,046 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:17,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:17,047 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2022-04-15 07:17:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2022-04-15 07:17:17,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:17,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:17,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 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 132 states. [2022-04-15 07:17:17,048 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 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 132 states. [2022-04-15 07:17:17,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:17,049 INFO L93 Difference]: Finished difference Result 132 states and 151 transitions. [2022-04-15 07:17:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 151 transitions. [2022-04-15 07:17:17,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:17,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:17,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:17,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:17,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.063157894736842) internal successors, (101), 95 states have internal predecessors, (101), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:17,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-04-15 07:17:17,050 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 94 [2022-04-15 07:17:17,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:17,050 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-04-15 07:17:17,051 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 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:17:17,051 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 104 transitions. [2022-04-15 07:17:17,348 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:17:17,349 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-04-15 07:17:17,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-15 07:17:17,349 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:17,349 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:17,349 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-15 07:17:17,349 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:17,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:17,351 INFO L85 PathProgramCache]: Analyzing trace with hash -370771538, now seen corresponding path program 34 times [2022-04-15 07:17:17,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:17,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1794116874] [2022-04-15 07:17:17,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:17:17,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:17:17,721 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:17,721 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:17,811 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:17:17,876 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:17:17,894 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:17,894 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:17,962 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:17:18,019 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:17:18,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:18,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:18,100 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:17:18,210 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:17:18,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:18,234 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:18,323 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:17:18,388 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:17:18,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:18,619 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:18,620 INFO L85 PathProgramCache]: Analyzing trace with hash 1833937707, now seen corresponding path program 1 times [2022-04-15 07:17:18,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:18,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392808934] [2022-04-15 07:17:18,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:18,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:18,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:18,638 INFO L290 TraceCheckUtils]: 0: Hoare triple {22457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22451#true} is VALID [2022-04-15 07:17:18,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {22451#true} assume true; {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22451#true} {22451#true} #92#return; {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {22451#true} call ULTIMATE.init(); {22457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:18,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {22457#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {22451#true} assume true; {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22451#true} {22451#true} #92#return; {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {22451#true} call #t~ret10 := main(); {22451#true} is VALID [2022-04-15 07:17:18,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {22451#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {22456#(= main_~a~0 0)} is VALID [2022-04-15 07:17:18,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {22456#(= main_~a~0 0)} [172] L23-3-->L23-4_primed: Formula: (and (= |v_main_#t~pre5_232| |v_main_#t~pre5_231|) (= v_main_~d~0_504 v_main_~d~0_502) (= v_main_~b~0_319 v_main_~b~0_317) (= v_main_~f~0_6240 v_main_~f~0_6205) (= |v_main_#t~pre8_2258| |v_main_#t~pre8_2253|) (= v_main_~a~0_238 v_main_~a~0_237) (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|) (= v_main_~c~0_416 v_main_~c~0_414) (= |v_main_#t~pre7_337| |v_main_#t~pre7_336|) (= |v_main_#t~pre6_288| |v_main_#t~pre6_287|) (= v_main_~e~0_2701 v_main_~e~0_2695) (= |v_main_#t~pre9_4188| |v_main_#t~pre9_4158|)) InVars {main_~e~0=v_main_~e~0_2701, main_~d~0=v_main_~d~0_504, main_~b~0=v_main_~b~0_319, main_~f~0=v_main_~f~0_6240, main_#t~pre7=|v_main_#t~pre7_337|, main_~c~0=v_main_~c~0_416, main_#t~pre8=|v_main_#t~pre8_2258|, main_#t~pre9=|v_main_#t~pre9_4188|, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_232|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_288|} OutVars{main_~e~0=v_main_~e~0_2695, main_~d~0=v_main_~d~0_502, main_~b~0=v_main_~b~0_317, main_~f~0=v_main_~f~0_6205, main_#t~pre7=|v_main_#t~pre7_336|, main_~c~0=v_main_~c~0_414, main_#t~pre8=|v_main_#t~pre8_2253|, main_#t~pre9=|v_main_#t~pre9_4158|, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_231|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_287|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {22456#(= main_~a~0 0)} is VALID [2022-04-15 07:17:18,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {22456#(= main_~a~0 0)} [171] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {22452#false} is VALID [2022-04-15 07:17:18,640 INFO L290 TraceCheckUtils]: 8: Hoare triple {22452#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {22452#false} is VALID [2022-04-15 07:17:18,640 INFO L290 TraceCheckUtils]: 9: Hoare triple {22452#false} assume !false; {22452#false} is VALID [2022-04-15 07:17:18,640 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:17:18,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:18,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392808934] [2022-04-15 07:17:18,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392808934] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:18,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:18,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:19,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:19,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1794116874] [2022-04-15 07:17:19,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1794116874] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:19,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:19,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 07:17:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887261752] [2022-04-15 07:17:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:19,873 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:19,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:19,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:19,940 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:17:19,940 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 07:17:19,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:19,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 07:17:19,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=1646, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 07:17:19,941 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:24,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:24,074 INFO L93 Difference]: Finished difference Result 148 states and 173 transitions. [2022-04-15 07:17:24,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 07:17:24,074 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:24,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 173 transitions. [2022-04-15 07:17:24,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:24,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 173 transitions. [2022-04-15 07:17:24,076 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 173 transitions. [2022-04-15 07:17:24,178 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:24,184 INFO L225 Difference]: With dead ends: 148 [2022-04-15 07:17:24,184 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 07:17:24,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 39 SyntacticMatches, 16 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1277 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=732, Invalid=6408, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 07:17:24,185 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 220 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 2702 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 2702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:24,185 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 90 Invalid, 2824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 2702 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-15 07:17:24,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 07:17:24,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 101. [2022-04-15 07:17:24,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:24,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:24,255 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:24,255 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:24,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:24,256 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-04-15 07:17:24,256 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2022-04-15 07:17:24,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:24,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:24,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 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 133 states. [2022-04-15 07:17:24,256 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 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 133 states. [2022-04-15 07:17:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:24,257 INFO L93 Difference]: Finished difference Result 133 states and 152 transitions. [2022-04-15 07:17:24,257 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 152 transitions. [2022-04-15 07:17:24,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:24,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:24,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:24,258 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0618556701030928) internal successors, (103), 97 states have internal predecessors, (103), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:24,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-04-15 07:17:24,258 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 96 [2022-04-15 07:17:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:24,259 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-04-15 07:17:24,259 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 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:17:24,259 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 106 transitions. [2022-04-15 07:17:24,568 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:17:24,568 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-04-15 07:17:24,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 07:17:24,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:24,568 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:24,569 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-15 07:17:24,569 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:24,569 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:24,569 INFO L85 PathProgramCache]: Analyzing trace with hash 120569351, now seen corresponding path program 35 times [2022-04-15 07:17:24,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:24,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1239156865] [2022-04-15 07:17:24,871 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:17:24,949 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:17:24,967 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:24,967 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:24,987 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:17:25,079 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:17:25,137 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:17:25,152 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:25,153 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:25,170 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:17:25,246 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:17:25,304 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:17:25,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:25,320 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:25,339 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:17:25,409 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:17:25,466 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:17:25,482 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:17:25,482 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:17:25,500 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:17:25,570 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:17:25,629 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:17:25,777 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:25,778 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:25,778 INFO L85 PathProgramCache]: Analyzing trace with hash 1833999211, now seen corresponding path program 1 times [2022-04-15 07:17:25,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:25,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730842904] [2022-04-15 07:17:25,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:25,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:25,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:25,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:25,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:25,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {23352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23346#true} is VALID [2022-04-15 07:17:25,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {23346#true} assume true; {23346#true} is VALID [2022-04-15 07:17:25,807 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23346#true} {23346#true} #92#return; {23346#true} is VALID [2022-04-15 07:17:25,807 INFO L272 TraceCheckUtils]: 0: Hoare triple {23346#true} call ULTIMATE.init(); {23352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:25,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {23352#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {23346#true} is VALID [2022-04-15 07:17:25,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {23346#true} assume true; {23346#true} is VALID [2022-04-15 07:17:25,807 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23346#true} {23346#true} #92#return; {23346#true} is VALID [2022-04-15 07:17:25,807 INFO L272 TraceCheckUtils]: 4: Hoare triple {23346#true} call #t~ret10 := main(); {23346#true} is VALID [2022-04-15 07:17:25,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {23346#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {23351#(= main_~a~0 0)} is VALID [2022-04-15 07:17:25,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {23351#(= main_~a~0 0)} [174] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_238| |v_main_#t~pre5_237|)) (.cse1 (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|)) (.cse2 (= |v_main_#t~pre7_345| |v_main_#t~pre7_344|)) (.cse3 (= v_main_~a~0_244 v_main_~a~0_243)) (.cse4 (= |v_main_#t~pre6_295| |v_main_#t~pre6_294|)) (.cse5 (= |v_main_#t~pre9_4350| |v_main_#t~pre9_4320|)) (.cse6 (= v_main_~e~0_2799 v_main_~e~0_2792)) (.cse7 (= v_main_~b~0_327 v_main_~b~0_325)) (.cse8 (= v_main_~f~0_6513 v_main_~f~0_6477)) (.cse9 (= v_main_~c~0_426 v_main_~c~0_424))) (or (and .cse0 .cse1 (= |v_main_#t~pre8_2339| |v_main_#t~pre8_2333|) .cse2 .cse3 .cse4 (= v_main_~d~0_516 v_main_~d~0_514) .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |v_main_#t~pre8_2333| |v_main_#t~pre8_2339|) (= v_main_~d~0_514 v_main_~d~0_516) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_2799, main_~d~0=v_main_~d~0_516, main_~b~0=v_main_~b~0_327, main_~f~0=v_main_~f~0_6513, main_#t~pre7=|v_main_#t~pre7_345|, main_~c~0=v_main_~c~0_426, main_#t~pre8=|v_main_#t~pre8_2339|, main_#t~pre9=|v_main_#t~pre9_4350|, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_238|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_295|} OutVars{main_~e~0=v_main_~e~0_2792, main_~d~0=v_main_~d~0_514, main_~b~0=v_main_~b~0_325, main_~f~0=v_main_~f~0_6477, main_#t~pre7=|v_main_#t~pre7_344|, main_~c~0=v_main_~c~0_424, main_#t~pre8=|v_main_#t~pre8_2333|, main_#t~pre9=|v_main_#t~pre9_4320|, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_237|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_294|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {23351#(= main_~a~0 0)} is VALID [2022-04-15 07:17:25,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {23351#(= main_~a~0 0)} [173] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {23347#false} is VALID [2022-04-15 07:17:25,809 INFO L290 TraceCheckUtils]: 8: Hoare triple {23347#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {23347#false} is VALID [2022-04-15 07:17:25,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {23347#false} assume !false; {23347#false} is VALID [2022-04-15 07:17:25,809 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:17:25,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:25,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730842904] [2022-04-15 07:17:25,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730842904] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:25,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:25,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:27,360 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:27,360 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1239156865] [2022-04-15 07:17:27,360 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1239156865] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:27,360 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:27,361 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 07:17:27,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533268184] [2022-04-15 07:17:27,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:27,361 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 07:17:27,361 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:27,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:27,405 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:17:27,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 07:17:27,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:27,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 07:17:27,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=252, Invalid=1728, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 07:17:27,406 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:31,099 INFO L93 Difference]: Finished difference Result 150 states and 175 transitions. [2022-04-15 07:17:31,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 07:17:31,100 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2022-04-15 07:17:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:31,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 175 transitions. [2022-04-15 07:17:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:31,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 175 transitions. [2022-04-15 07:17:31,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 175 transitions. [2022-04-15 07:17:31,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:31,184 INFO L225 Difference]: With dead ends: 150 [2022-04-15 07:17:31,184 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 07:17:31,185 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 35 SyntacticMatches, 22 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1373 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=750, Invalid=6732, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 07:17:31,185 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 244 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2925 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 2925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:31,186 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [244 Valid, 25 Invalid, 3057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 2925 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-15 07:17:31,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 07:17:31,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 102. [2022-04-15 07:17:31,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:31,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:31,252 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:31,252 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:31,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:31,254 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 07:17:31,254 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 07:17:31,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:31,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:31,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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 135 states. [2022-04-15 07:17:31,273 INFO L87 Difference]: Start difference. First operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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 135 states. [2022-04-15 07:17:31,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:31,274 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2022-04-15 07:17:31,274 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 154 transitions. [2022-04-15 07:17:31,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:31,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:31,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:31,281 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 98 states have (on average 1.0612244897959184) internal successors, (104), 98 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:17:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-04-15 07:17:31,283 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 99 [2022-04-15 07:17:31,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:31,283 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-04-15 07:17:31,283 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.1333333333333333) internal successors, (96), 44 states have internal predecessors, (96), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:31,283 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 107 transitions. [2022-04-15 07:17:31,577 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:17:31,577 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-04-15 07:17:31,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 07:17:31,578 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:31,578 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:31,578 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-15 07:17:31,578 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:31,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:31,578 INFO L85 PathProgramCache]: Analyzing trace with hash -181160923, now seen corresponding path program 36 times [2022-04-15 07:17:31,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:31,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [407381321] [2022-04-15 07:17:33,576 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:33,622 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:17:33,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:17:33,839 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:17:33,892 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:17:35,966 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:36,016 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:17:36,102 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:17:36,235 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:17:36,261 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:17:40,331 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:40,382 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:17:40,470 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:17:40,644 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:17:40,689 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:17:42,918 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:17:43,010 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:17:43,177 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:17:43,224 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:17:47,308 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:47,362 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:17:47,454 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:17:47,689 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:17:47,689 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:17:47,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1834060715, now seen corresponding path program 1 times [2022-04-15 07:17:47,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:17:47,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729448443] [2022-04-15 07:17:47,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:17:47,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:17:47,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:47,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:17:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:17:47,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {24260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {24254#true} is VALID [2022-04-15 07:17:47,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {24254#true} assume true; {24254#true} is VALID [2022-04-15 07:17:47,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24254#true} {24254#true} #92#return; {24254#true} is VALID [2022-04-15 07:17:47,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {24254#true} call ULTIMATE.init(); {24260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:17:47,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {24260#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {24254#true} is VALID [2022-04-15 07:17:47,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {24254#true} assume true; {24254#true} is VALID [2022-04-15 07:17:47,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24254#true} {24254#true} #92#return; {24254#true} is VALID [2022-04-15 07:17:47,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {24254#true} call #t~ret10 := main(); {24254#true} is VALID [2022-04-15 07:17:47,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {24254#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {24259#(= main_~a~0 0)} is VALID [2022-04-15 07:17:47,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {24259#(= main_~a~0 0)} [176] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_2909 v_main_~e~0_2902)) (.cse1 (= v_main_~b~0_335 v_main_~b~0_333)) (.cse2 (= |v_main_#t~pre6_302| |v_main_#t~pre6_301|)) (.cse3 (= v_main_~f~0_6808 v_main_~f~0_6771)) (.cse4 (= |v_main_#t~pre9_4553| |v_main_#t~pre9_4522|)) (.cse5 (= v_main_~c~0_436 v_main_~c~0_434)) (.cse6 (= |v_main_#t~pre7_353| |v_main_#t~pre7_352|)) (.cse7 (= |v_main_#t~pre5_244| |v_main_#t~pre5_243|)) (.cse8 (= |v_main_#t~pre8_2436| |v_main_#t~pre8_2430|)) (.cse9 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_526 v_main_~d~0_528) (= v_main_~a~0_249 v_main_~a~0_250) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~d~0_528 v_main_~d~0_526) .cse8 .cse9 (= v_main_~a~0_250 v_main_~a~0_249)))) InVars {main_~e~0=v_main_~e~0_2909, main_~d~0=v_main_~d~0_528, main_~b~0=v_main_~b~0_335, main_~f~0=v_main_~f~0_6808, main_#t~pre7=|v_main_#t~pre7_353|, main_~c~0=v_main_~c~0_436, main_#t~pre8=|v_main_#t~pre8_2436|, main_#t~pre9=|v_main_#t~pre9_4553|, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_244|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_302|} OutVars{main_~e~0=v_main_~e~0_2902, main_~d~0=v_main_~d~0_526, main_~b~0=v_main_~b~0_333, main_~f~0=v_main_~f~0_6771, main_#t~pre7=|v_main_#t~pre7_352|, main_~c~0=v_main_~c~0_434, main_#t~pre8=|v_main_#t~pre8_2430|, main_#t~pre9=|v_main_#t~pre9_4522|, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_243|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_301|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {24259#(= main_~a~0 0)} is VALID [2022-04-15 07:17:47,713 INFO L290 TraceCheckUtils]: 7: Hoare triple {24259#(= main_~a~0 0)} [175] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {24255#false} is VALID [2022-04-15 07:17:47,713 INFO L290 TraceCheckUtils]: 8: Hoare triple {24255#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {24255#false} is VALID [2022-04-15 07:17:47,714 INFO L290 TraceCheckUtils]: 9: Hoare triple {24255#false} assume !false; {24255#false} is VALID [2022-04-15 07:17:47,714 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:17:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:17:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729448443] [2022-04-15 07:17:47,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729448443] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:47,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:47,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:17:49,073 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:17:49,073 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [407381321] [2022-04-15 07:17:49,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [407381321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:17:49,074 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:17:49,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 07:17:49,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880016907] [2022-04-15 07:17:49,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:17:49,074 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 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 101 [2022-04-15 07:17:49,075 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:17:49,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:49,140 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:17:49,140 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 07:17:49,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:49,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 07:17:49,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=258, Invalid=1812, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 07:17:49,141 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:53,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:53,876 INFO L93 Difference]: Finished difference Result 152 states and 177 transitions. [2022-04-15 07:17:53,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 07:17:53,876 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 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 101 [2022-04-15 07:17:53,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:17:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:53,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 177 transitions. [2022-04-15 07:17:53,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:53,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 177 transitions. [2022-04-15 07:17:53,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 177 transitions. [2022-04-15 07:17:54,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:54,017 INFO L225 Difference]: With dead ends: 152 [2022-04-15 07:17:54,017 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 07:17:54,018 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 40 SyntacticMatches, 18 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1393 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=768, Invalid=7064, Unknown=0, NotChecked=0, Total=7832 [2022-04-15 07:17:54,018 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 208 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3239 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 3338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 3239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:17:54,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 30 Invalid, 3338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 3239 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-15 07:17:54,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 07:17:54,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 104. [2022-04-15 07:17:54,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:17:54,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:54,085 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:54,085 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:54,086 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2022-04-15 07:17:54,086 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-04-15 07:17:54,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:54,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:54,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 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 137 states. [2022-04-15 07:17:54,086 INFO L87 Difference]: Start difference. First operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 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 137 states. [2022-04-15 07:17:54,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:17:54,087 INFO L93 Difference]: Finished difference Result 137 states and 156 transitions. [2022-04-15 07:17:54,087 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-04-15 07:17:54,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:17:54,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:17:54,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:17:54,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:17:54,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 100 states have (on average 1.06) internal successors, (106), 100 states have internal predecessors, (106), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:54,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2022-04-15 07:17:54,088 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 101 [2022-04-15 07:17:54,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:17:54,089 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2022-04-15 07:17:54,089 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.130434782608696) internal successors, (98), 45 states have internal predecessors, (98), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:17:54,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 109 transitions. [2022-04-15 07:17:54,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:17:54,434 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-04-15 07:17:54,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 07:17:54,434 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:17:54,434 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:17:54,434 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-15 07:17:54,434 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:17:54,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:17:54,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1913821891, now seen corresponding path program 37 times [2022-04-15 07:17:54,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:17:54,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1373940490] [2022-04-15 07:17:57,281 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:17:57,332 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:17:57,420 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:18:01,526 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:01,603 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:18:01,648 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:18:04,667 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:04,717 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:18:04,803 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:18:08,911 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:09,000 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:18:09,047 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:18:11,224 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:18:11,306 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:18:15,409 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:15,473 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:18:15,514 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:18:19,591 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:19,640 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:18:19,724 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:18:23,213 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:23,276 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:18:23,318 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:18:25,483 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:18:25,569 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:18:25,789 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:25,789 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:25,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1834122219, now seen corresponding path program 1 times [2022-04-15 07:18:25,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:25,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232826957] [2022-04-15 07:18:25,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:25,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:25,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:25,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:25,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:25,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25177#true} is VALID [2022-04-15 07:18:25,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-15 07:18:25,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25177#true} {25177#true} #92#return; {25177#true} is VALID [2022-04-15 07:18:25,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {25177#true} call ULTIMATE.init(); {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:25,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {25183#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {25177#true} is VALID [2022-04-15 07:18:25,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {25177#true} assume true; {25177#true} is VALID [2022-04-15 07:18:25,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25177#true} {25177#true} #92#return; {25177#true} is VALID [2022-04-15 07:18:25,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {25177#true} call #t~ret10 := main(); {25177#true} is VALID [2022-04-15 07:18:25,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {25177#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {25182#(= main_~a~0 0)} is VALID [2022-04-15 07:18:25,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {25182#(= main_~a~0 0)} [178] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_3019 v_main_~e~0_3012)) (.cse1 (= v_main_~a~0_256 v_main_~a~0_255)) (.cse2 (= |v_main_#t~pre9_4761| |v_main_#t~pre9_4729|)) (.cse3 (= |v_main_#t~pre5_250| |v_main_#t~pre5_249|)) (.cse4 (= v_main_~c~0_446 v_main_~c~0_444)) (.cse5 (= v_main_~b~0_343 v_main_~b~0_341)) (.cse6 (= v_main_~d~0_540 v_main_~d~0_538)) (.cse7 (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|)) (.cse8 (= |v_main_#t~pre6_309| |v_main_#t~pre6_308|)) (.cse9 (= |v_main_#t~pre7_361| |v_main_#t~pre7_360|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~f~0_7109 v_main_~f~0_7071) .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_2533| |v_main_#t~pre8_2527|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre8_2527| |v_main_#t~pre8_2533|) (= v_main_~f~0_7071 v_main_~f~0_7109) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3019, main_~d~0=v_main_~d~0_540, main_~b~0=v_main_~b~0_343, main_~f~0=v_main_~f~0_7109, main_#t~pre7=|v_main_#t~pre7_361|, main_~c~0=v_main_~c~0_446, main_#t~pre8=|v_main_#t~pre8_2533|, main_#t~pre9=|v_main_#t~pre9_4761|, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_250|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_309|} OutVars{main_~e~0=v_main_~e~0_3012, main_~d~0=v_main_~d~0_538, main_~b~0=v_main_~b~0_341, main_~f~0=v_main_~f~0_7071, main_#t~pre7=|v_main_#t~pre7_360|, main_~c~0=v_main_~c~0_444, main_#t~pre8=|v_main_#t~pre8_2527|, main_#t~pre9=|v_main_#t~pre9_4729|, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_308|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {25182#(= main_~a~0 0)} is VALID [2022-04-15 07:18:25,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {25182#(= main_~a~0 0)} [177] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {25178#false} is VALID [2022-04-15 07:18:25,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {25178#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {25178#false} is VALID [2022-04-15 07:18:25,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {25178#false} assume !false; {25178#false} is VALID [2022-04-15 07:18:25,826 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:18:25,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:25,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232826957] [2022-04-15 07:18:25,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232826957] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:25,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:25,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:27,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:27,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1373940490] [2022-04-15 07:18:27,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1373940490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:27,180 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:27,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 07:18:27,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204500429] [2022-04-15 07:18:27,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:27,181 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 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 103 [2022-04-15 07:18:27,181 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:27,181 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:27,254 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:18:27,254 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 07:18:27,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:27,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 07:18:27,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1898, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 07:18:27,255 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:31,624 INFO L93 Difference]: Finished difference Result 154 states and 179 transitions. [2022-04-15 07:18:31,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 07:18:31,625 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 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 103 [2022-04-15 07:18:31,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:31,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 179 transitions. [2022-04-15 07:18:31,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 179 transitions. [2022-04-15 07:18:31,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 179 transitions. [2022-04-15 07:18:31,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:31,712 INFO L225 Difference]: With dead ends: 154 [2022-04-15 07:18:31,712 INFO L226 Difference]: Without dead ends: 139 [2022-04-15 07:18:31,712 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 37 SyntacticMatches, 22 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=786, Invalid=7404, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 07:18:31,713 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 250 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 3380 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 3518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 3380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:31,713 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [250 Valid, 45 Invalid, 3518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 3380 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 07:18:31,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-04-15 07:18:31,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 106. [2022-04-15 07:18:31,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:31,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,782 INFO L74 IsIncluded]: Start isIncluded. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,782 INFO L87 Difference]: Start difference. First operand 139 states. Second operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:31,783 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-04-15 07:18:31,784 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-04-15 07:18:31,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:31,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:31,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 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 139 states. [2022-04-15 07:18:31,784 INFO L87 Difference]: Start difference. First operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 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 139 states. [2022-04-15 07:18:31,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:31,800 INFO L93 Difference]: Finished difference Result 139 states and 158 transitions. [2022-04-15 07:18:31,800 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-04-15 07:18:31,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:31,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:31,800 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:31,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:31,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 102 states have (on average 1.0588235294117647) internal successors, (108), 102 states have internal predecessors, (108), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2022-04-15 07:18:31,802 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 103 [2022-04-15 07:18:31,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:31,802 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2022-04-15 07:18:31,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.127659574468085) internal successors, (100), 46 states have internal predecessors, (100), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:31,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 111 transitions. [2022-04-15 07:18:32,130 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2022-04-15 07:18:32,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 07:18:32,131 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:32,131 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:32,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-15 07:18:32,131 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:32,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:32,131 INFO L85 PathProgramCache]: Analyzing trace with hash 852644321, now seen corresponding path program 38 times [2022-04-15 07:18:32,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:32,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1001932682] [2022-04-15 07:18:32,418 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:18:32,504 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:18:35,293 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:35,349 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:18:35,394 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:18:35,509 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:18:35,597 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:18:37,959 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:18:38,013 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:18:38,121 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:18:38,211 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:18:39,195 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:18:39,239 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:18:39,349 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:18:39,440 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:18:43,526 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:18:43,582 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:18:43,628 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:18:43,738 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:18:43,826 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:18:44,063 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:44,063 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:44,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1834183723, now seen corresponding path program 1 times [2022-04-15 07:18:44,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:44,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870915879] [2022-04-15 07:18:44,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:44,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:44,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:44,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:44,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:44,088 INFO L290 TraceCheckUtils]: 0: Hoare triple {26121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {26115#true} is VALID [2022-04-15 07:18:44,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {26115#true} assume true; {26115#true} is VALID [2022-04-15 07:18:44,088 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26115#true} {26115#true} #92#return; {26115#true} is VALID [2022-04-15 07:18:44,089 INFO L272 TraceCheckUtils]: 0: Hoare triple {26115#true} call ULTIMATE.init(); {26121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:44,089 INFO L290 TraceCheckUtils]: 1: Hoare triple {26121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {26115#true} is VALID [2022-04-15 07:18:44,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {26115#true} assume true; {26115#true} is VALID [2022-04-15 07:18:44,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26115#true} {26115#true} #92#return; {26115#true} is VALID [2022-04-15 07:18:44,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {26115#true} call #t~ret10 := main(); {26115#true} is VALID [2022-04-15 07:18:44,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {26115#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {26120#(= main_~a~0 0)} is VALID [2022-04-15 07:18:44,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {26120#(= main_~a~0 0)} [180] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_256| |v_main_#t~pre5_255|)) (.cse1 (= |v_main_#t~pre7_369| |v_main_#t~pre7_368|)) (.cse2 (= |v_main_#t~pre9_4974| |v_main_#t~pre9_4941|)) (.cse3 (= v_main_~c~0_456 v_main_~c~0_454)) (.cse4 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse5 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse6 (= v_main_~f~0_7416 v_main_~f~0_7377)) (.cse7 (= |v_main_#t~pre6_316| |v_main_#t~pre6_315|)) (.cse8 (= v_main_~d~0_552 v_main_~d~0_550)) (.cse9 (= v_main_~e~0_3129 v_main_~e~0_3122))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~b~0_349 v_main_~b~0_351) .cse4 (= |v_main_#t~pre8_2624| |v_main_#t~pre8_2630|) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= v_main_~b~0_351 v_main_~b~0_349) .cse3 .cse4 .cse5 .cse6 .cse7 (= |v_main_#t~pre8_2630| |v_main_#t~pre8_2624|) .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3129, main_~d~0=v_main_~d~0_552, main_~b~0=v_main_~b~0_351, main_~f~0=v_main_~f~0_7416, main_#t~pre7=|v_main_#t~pre7_369|, main_~c~0=v_main_~c~0_456, main_#t~pre8=|v_main_#t~pre8_2630|, main_#t~pre9=|v_main_#t~pre9_4974|, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_256|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_316|} OutVars{main_~e~0=v_main_~e~0_3122, main_~d~0=v_main_~d~0_550, main_~b~0=v_main_~b~0_349, main_~f~0=v_main_~f~0_7377, main_#t~pre7=|v_main_#t~pre7_368|, main_~c~0=v_main_~c~0_454, main_#t~pre8=|v_main_#t~pre8_2624|, main_#t~pre9=|v_main_#t~pre9_4941|, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_255|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_315|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {26120#(= main_~a~0 0)} is VALID [2022-04-15 07:18:44,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {26120#(= main_~a~0 0)} [179] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {26116#false} is VALID [2022-04-15 07:18:44,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {26116#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {26116#false} is VALID [2022-04-15 07:18:44,090 INFO L290 TraceCheckUtils]: 9: Hoare triple {26116#false} assume !false; {26116#false} is VALID [2022-04-15 07:18:44,090 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:18:44,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:44,091 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870915879] [2022-04-15 07:18:44,091 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870915879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:44,091 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:44,091 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:45,568 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:45,569 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1001932682] [2022-04-15 07:18:45,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1001932682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:45,569 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:45,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 07:18:45,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86662151] [2022-04-15 07:18:45,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:45,569 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 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 105 [2022-04-15 07:18:45,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:45,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:45,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:45,633 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 07:18:45,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:45,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 07:18:45,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1986, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 07:18:45,633 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:50,638 INFO L93 Difference]: Finished difference Result 156 states and 181 transitions. [2022-04-15 07:18:50,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 07:18:50,638 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 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 105 [2022-04-15 07:18:50,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:50,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 181 transitions. [2022-04-15 07:18:50,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 181 transitions. [2022-04-15 07:18:50,640 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 181 transitions. [2022-04-15 07:18:50,723 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:50,724 INFO L225 Difference]: With dead ends: 156 [2022-04-15 07:18:50,724 INFO L226 Difference]: Without dead ends: 141 [2022-04-15 07:18:50,725 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 38 SyntacticMatches, 22 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=804, Invalid=7752, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 07:18:50,725 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 253 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 3864 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 4005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 3864 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:50,726 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 85 Invalid, 4005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 3864 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 07:18:50,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-04-15 07:18:50,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 108. [2022-04-15 07:18:50,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:50,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,804 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,805 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:50,806 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-04-15 07:18:50,806 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-04-15 07:18:50,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:50,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:50,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 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 141 states. [2022-04-15 07:18:50,806 INFO L87 Difference]: Start difference. First operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 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 141 states. [2022-04-15 07:18:50,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:50,807 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-04-15 07:18:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-04-15 07:18:50,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:50,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:50,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:50,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:50,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 104 states have (on average 1.0576923076923077) internal successors, (110), 104 states have internal predecessors, (110), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2022-04-15 07:18:50,808 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 105 [2022-04-15 07:18:50,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:50,809 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2022-04-15 07:18:50,809 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.125) internal successors, (102), 47 states have internal predecessors, (102), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:50,809 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 113 transitions. [2022-04-15 07:18:51,136 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:18:51,136 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2022-04-15 07:18:51,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 07:18:51,137 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:51,137 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:51,137 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-15 07:18:51,137 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:51,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:51,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1031751297, now seen corresponding path program 39 times [2022-04-15 07:18:51,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:51,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1459736552] [2022-04-15 07:18:51,331 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:18:51,387 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:18:51,403 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:51,403 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:51,423 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:18:51,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:18:51,548 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:18:51,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:51,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:51,585 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:18:51,655 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:18:51,714 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:18:51,730 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:51,730 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:51,750 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:18:51,819 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:18:51,876 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:18:51,892 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:51,893 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:51,913 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:18:51,982 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:18:52,041 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:18:52,207 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:52,207 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1834245227, now seen corresponding path program 1 times [2022-04-15 07:18:52,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:52,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525136948] [2022-04-15 07:18:52,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:52,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:52,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:52,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:52,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {27074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {27068#true} is VALID [2022-04-15 07:18:52,247 INFO L290 TraceCheckUtils]: 1: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-15 07:18:52,247 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27068#true} {27068#true} #92#return; {27068#true} is VALID [2022-04-15 07:18:52,247 INFO L272 TraceCheckUtils]: 0: Hoare triple {27068#true} call ULTIMATE.init(); {27074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:52,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {27074#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {27068#true} is VALID [2022-04-15 07:18:52,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {27068#true} assume true; {27068#true} is VALID [2022-04-15 07:18:52,248 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27068#true} {27068#true} #92#return; {27068#true} is VALID [2022-04-15 07:18:52,248 INFO L272 TraceCheckUtils]: 4: Hoare triple {27068#true} call #t~ret10 := main(); {27068#true} is VALID [2022-04-15 07:18:52,248 INFO L290 TraceCheckUtils]: 5: Hoare triple {27068#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {27073#(= main_~a~0 0)} is VALID [2022-04-15 07:18:52,248 INFO L290 TraceCheckUtils]: 6: Hoare triple {27073#(= main_~a~0 0)} [182] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_7713 v_main_~f~0_7673)) (.cse1 (= |v_main_#t~pre4_219| |v_main_#t~pre4_218|)) (.cse2 (= v_main_~a~0_268 v_main_~a~0_267)) (.cse3 (= |v_main_#t~pre5_262| |v_main_#t~pre5_261|)) (.cse4 (= v_main_~d~0_564 v_main_~d~0_562)) (.cse5 (= |v_main_#t~pre7_377| |v_main_#t~pre7_376|)) (.cse6 (= |v_main_#t~pre9_5176| |v_main_#t~pre9_5142|)) (.cse7 (= v_main_~b~0_359 v_main_~b~0_357)) (.cse8 (= v_main_~c~0_466 v_main_~c~0_464)) (.cse9 (= v_main_~e~0_3227 v_main_~e~0_3220)) (.cse10 (= |v_main_#t~pre6_323| |v_main_#t~pre6_322|))) (or (and (= |v_main_#t~pre8_2705| |v_main_#t~pre8_2711|) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10 (= |v_main_#t~pre8_2711| |v_main_#t~pre8_2705|)))) InVars {main_~e~0=v_main_~e~0_3227, main_~d~0=v_main_~d~0_564, main_~b~0=v_main_~b~0_359, main_~f~0=v_main_~f~0_7713, main_#t~pre7=|v_main_#t~pre7_377|, main_~c~0=v_main_~c~0_466, main_#t~pre8=|v_main_#t~pre8_2711|, main_#t~pre9=|v_main_#t~pre9_5176|, main_#t~pre4=|v_main_#t~pre4_219|, main_#t~pre5=|v_main_#t~pre5_262|, main_~a~0=v_main_~a~0_268, main_#t~pre6=|v_main_#t~pre6_323|} OutVars{main_~e~0=v_main_~e~0_3220, main_~d~0=v_main_~d~0_562, main_~b~0=v_main_~b~0_357, main_~f~0=v_main_~f~0_7673, main_#t~pre7=|v_main_#t~pre7_376|, main_~c~0=v_main_~c~0_464, main_#t~pre8=|v_main_#t~pre8_2705|, main_#t~pre9=|v_main_#t~pre9_5142|, main_#t~pre4=|v_main_#t~pre4_218|, main_#t~pre5=|v_main_#t~pre5_261|, main_~a~0=v_main_~a~0_267, main_#t~pre6=|v_main_#t~pre6_322|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {27073#(= main_~a~0 0)} is VALID [2022-04-15 07:18:52,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {27073#(= main_~a~0 0)} [181] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {27069#false} is VALID [2022-04-15 07:18:52,249 INFO L290 TraceCheckUtils]: 8: Hoare triple {27069#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {27069#false} is VALID [2022-04-15 07:18:52,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {27069#false} assume !false; {27069#false} is VALID [2022-04-15 07:18:52,249 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:18:52,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:52,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525136948] [2022-04-15 07:18:52,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525136948] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:52,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:52,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:18:53,469 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:18:53,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1459736552] [2022-04-15 07:18:53,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1459736552] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:53,470 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:53,470 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 07:18:53,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102585591] [2022-04-15 07:18:53,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:18:53,470 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 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 107 [2022-04-15 07:18:53,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:18:53,470 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:53,517 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:18:53,517 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 07:18:53,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:53,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 07:18:53,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2076, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 07:18:53,518 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:57,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:57,880 INFO L93 Difference]: Finished difference Result 158 states and 183 transitions. [2022-04-15 07:18:57,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 07:18:57,880 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 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 107 [2022-04-15 07:18:57,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:18:57,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:57,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 183 transitions. [2022-04-15 07:18:57,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:57,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 183 transitions. [2022-04-15 07:18:57,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 183 transitions. [2022-04-15 07:18:57,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:18:57,970 INFO L225 Difference]: With dead ends: 158 [2022-04-15 07:18:57,970 INFO L226 Difference]: Without dead ends: 143 [2022-04-15 07:18:57,970 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 42 SyntacticMatches, 19 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=822, Invalid=8108, Unknown=0, NotChecked=0, Total=8930 [2022-04-15 07:18:57,972 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 346 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3725 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 218 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-04-15 07:18:57,972 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [346 Valid, 25 Invalid, 3725 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [218 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-04-15 07:18:57,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-04-15 07:18:58,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 110. [2022-04-15 07:18:58,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:18:58,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:58,050 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:58,050 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:58,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:58,051 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-15 07:18:58,051 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-04-15 07:18:58,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:58,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:58,051 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 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 143 states. [2022-04-15 07:18:58,051 INFO L87 Difference]: Start difference. First operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 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 143 states. [2022-04-15 07:18:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:18:58,052 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-04-15 07:18:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-04-15 07:18:58,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:18:58,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:18:58,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:18:58,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:18:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.0566037735849056) internal successors, (112), 106 states have internal predecessors, (112), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:58,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2022-04-15 07:18:58,054 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 107 [2022-04-15 07:18:58,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:18:58,054 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2022-04-15 07:18:58,054 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.122448979591837) internal successors, (104), 48 states have internal predecessors, (104), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:18:58,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 115 transitions. [2022-04-15 07:18:58,393 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:18:58,393 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2022-04-15 07:18:58,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 07:18:58,393 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:18:58,393 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:18:58,393 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-15 07:18:58,394 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:18:58,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:18:58,394 INFO L85 PathProgramCache]: Analyzing trace with hash 540258717, now seen corresponding path program 40 times [2022-04-15 07:18:58,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:18:58,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [703616954] [2022-04-15 07:18:58,593 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:18:58,668 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:18:58,688 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:58,688 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:58,714 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:18:58,790 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:18:58,872 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:18:58,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:58,891 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:58,914 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:18:58,984 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:18:59,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:18:59,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:59,066 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:59,089 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:18:59,157 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:18:59,221 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:18:59,239 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:18:59,239 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:18:59,262 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:18:59,339 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:18:59,401 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:18:59,562 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:18:59,562 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:18:59,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1834306731, now seen corresponding path program 1 times [2022-04-15 07:18:59,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:18:59,563 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783862607] [2022-04-15 07:18:59,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:18:59,563 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:18:59,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:18:59,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:18:59,603 INFO L290 TraceCheckUtils]: 0: Hoare triple {28042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {28036#true} assume true; {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28036#true} {28036#true} #92#return; {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L272 TraceCheckUtils]: 0: Hoare triple {28036#true} call ULTIMATE.init(); {28042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:18:59,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {28042#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L290 TraceCheckUtils]: 2: Hoare triple {28036#true} assume true; {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28036#true} {28036#true} #92#return; {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L272 TraceCheckUtils]: 4: Hoare triple {28036#true} call #t~ret10 := main(); {28036#true} is VALID [2022-04-15 07:18:59,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {28036#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {28041#(= main_~a~0 0)} is VALID [2022-04-15 07:18:59,605 INFO L290 TraceCheckUtils]: 6: Hoare triple {28041#(= main_~a~0 0)} [184] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_476 v_main_~c~0_474)) (.cse1 (= |v_main_#t~pre5_268| |v_main_#t~pre5_267|)) (.cse2 (= |v_main_#t~pre6_330| |v_main_#t~pre6_329|)) (.cse3 (= v_main_~d~0_576 v_main_~d~0_574)) (.cse4 (= |v_main_#t~pre9_5383| |v_main_#t~pre9_5348|)) (.cse5 (= v_main_~a~0_274 v_main_~a~0_273)) (.cse6 (= v_main_~b~0_367 v_main_~b~0_365)) (.cse7 (= |v_main_#t~pre4_224| |v_main_#t~pre4_223|)) (.cse8 (= |v_main_#t~pre7_385| |v_main_#t~pre7_384|)) (.cse9 (= |v_main_#t~pre8_2792| |v_main_#t~pre8_2786|))) (or (and .cse0 .cse1 .cse2 (= v_main_~f~0_7975 v_main_~f~0_8016) .cse3 .cse4 (= v_main_~e~0_3318 v_main_~e~0_3325) .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~f~0_8016 v_main_~f~0_7975) .cse5 .cse6 .cse7 .cse8 .cse9 (= v_main_~e~0_3325 v_main_~e~0_3318)))) InVars {main_~e~0=v_main_~e~0_3325, main_~d~0=v_main_~d~0_576, main_~b~0=v_main_~b~0_367, main_~f~0=v_main_~f~0_8016, main_#t~pre7=|v_main_#t~pre7_385|, main_~c~0=v_main_~c~0_476, main_#t~pre8=|v_main_#t~pre8_2792|, main_#t~pre9=|v_main_#t~pre9_5383|, main_#t~pre4=|v_main_#t~pre4_224|, main_#t~pre5=|v_main_#t~pre5_268|, main_~a~0=v_main_~a~0_274, main_#t~pre6=|v_main_#t~pre6_330|} OutVars{main_~e~0=v_main_~e~0_3318, main_~d~0=v_main_~d~0_574, main_~b~0=v_main_~b~0_365, main_~f~0=v_main_~f~0_7975, main_#t~pre7=|v_main_#t~pre7_384|, main_~c~0=v_main_~c~0_474, main_#t~pre8=|v_main_#t~pre8_2786|, main_#t~pre9=|v_main_#t~pre9_5348|, main_#t~pre4=|v_main_#t~pre4_223|, main_#t~pre5=|v_main_#t~pre5_267|, main_~a~0=v_main_~a~0_273, main_#t~pre6=|v_main_#t~pre6_329|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {28041#(= main_~a~0 0)} is VALID [2022-04-15 07:18:59,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {28041#(= main_~a~0 0)} [183] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {28037#false} is VALID [2022-04-15 07:18:59,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {28037#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {28037#false} is VALID [2022-04-15 07:18:59,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {28037#false} assume !false; {28037#false} is VALID [2022-04-15 07:18:59,605 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:18:59,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:18:59,605 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783862607] [2022-04-15 07:18:59,605 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783862607] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:18:59,605 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:18:59,605 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:01,404 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:01,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [703616954] [2022-04-15 07:19:01,404 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [703616954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:01,404 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:01,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 07:19:01,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328022528] [2022-04-15 07:19:01,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:01,423 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 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 109 [2022-04-15 07:19:01,423 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:01,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:01,471 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:01,471 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 07:19:01,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 07:19:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=2168, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 07:19:01,477 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:06,060 INFO L93 Difference]: Finished difference Result 162 states and 188 transitions. [2022-04-15 07:19:06,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 07:19:06,060 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 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 109 [2022-04-15 07:19:06,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:19:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 188 transitions. [2022-04-15 07:19:06,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 188 transitions. [2022-04-15 07:19:06,062 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 188 transitions. [2022-04-15 07:19:06,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:06,150 INFO L225 Difference]: With dead ends: 162 [2022-04-15 07:19:06,150 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 07:19:06,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 38 SyntacticMatches, 24 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1679 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=840, Invalid=8472, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 07:19:06,152 INFO L913 BasicCegarLoop]: 13 mSDtfsCounter, 392 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 392 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 4219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:19:06,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [392 Valid, 30 Invalid, 4219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-04-15 07:19:06,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 07:19:06,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 114. [2022-04-15 07:19:06,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:19:06,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,242 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,242 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:06,243 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-04-15 07:19:06,244 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2022-04-15 07:19:06,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:06,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:06,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 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 147 states. [2022-04-15 07:19:06,244 INFO L87 Difference]: Start difference. First operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 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 147 states. [2022-04-15 07:19:06,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:06,245 INFO L93 Difference]: Finished difference Result 147 states and 166 transitions. [2022-04-15 07:19:06,245 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 166 transitions. [2022-04-15 07:19:06,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:06,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:06,245 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:19:06,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:19:06,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 110 states have (on average 1.0545454545454545) internal successors, (116), 110 states have internal predecessors, (116), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 119 transitions. [2022-04-15 07:19:06,246 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 119 transitions. Word has length 109 [2022-04-15 07:19:06,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:19:06,246 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 119 transitions. [2022-04-15 07:19:06,247 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.12) internal successors, (106), 49 states have internal predecessors, (106), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:06,247 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 119 transitions. [2022-04-15 07:19:06,607 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:19:06,607 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 119 transitions. [2022-04-15 07:19:06,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 07:19:06,608 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:19:06,608 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:19:06,608 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-04-15 07:19:06,608 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:19:06,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:19:06,608 INFO L85 PathProgramCache]: Analyzing trace with hash -586606021, now seen corresponding path program 41 times [2022-04-15 07:19:06,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:06,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323844516] [2022-04-15 07:19:11,414 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:11,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:19:11,550 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:19:11,648 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:19:13,781 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:19:13,856 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:19:13,968 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:19:18,028 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:18,078 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:19:18,165 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:19:18,294 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:19:20,437 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:19:20,522 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:19:20,651 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:19:24,739 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:24,790 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:19:24,881 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:19:25,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:25,118 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1834368235, now seen corresponding path program 1 times [2022-04-15 07:19:25,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:25,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542426165] [2022-04-15 07:19:25,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:25,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:25,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:25,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:25,139 INFO L290 TraceCheckUtils]: 0: Hoare triple {29037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29031#true} is VALID [2022-04-15 07:19:25,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {29031#true} assume true; {29031#true} is VALID [2022-04-15 07:19:25,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29031#true} {29031#true} #92#return; {29031#true} is VALID [2022-04-15 07:19:25,140 INFO L272 TraceCheckUtils]: 0: Hoare triple {29031#true} call ULTIMATE.init(); {29037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:25,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {29037#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {29031#true} is VALID [2022-04-15 07:19:25,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {29031#true} assume true; {29031#true} is VALID [2022-04-15 07:19:25,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29031#true} {29031#true} #92#return; {29031#true} is VALID [2022-04-15 07:19:25,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {29031#true} call #t~ret10 := main(); {29031#true} is VALID [2022-04-15 07:19:25,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {29031#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {29036#(= main_~a~0 0)} is VALID [2022-04-15 07:19:25,141 INFO L290 TraceCheckUtils]: 6: Hoare triple {29036#(= main_~a~0 0)} [186] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre7_393| |v_main_#t~pre7_392|)) (.cse1 (= |v_main_#t~pre6_337| |v_main_#t~pre6_336|)) (.cse2 (= v_main_~b~0_375 v_main_~b~0_373)) (.cse3 (= |v_main_#t~pre5_274| |v_main_#t~pre5_273|)) (.cse4 (= |v_main_#t~pre8_2868| |v_main_#t~pre8_2862|)) (.cse5 (= v_main_~e~0_3413 v_main_~e~0_3406)) (.cse6 (= v_main_~c~0_486 v_main_~c~0_484)) (.cse7 (= v_main_~f~0_8314 v_main_~f~0_8272)) (.cse8 (= v_main_~d~0_588 v_main_~d~0_586)) (.cse9 (= |v_main_#t~pre4_229| |v_main_#t~pre4_228|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_279 v_main_~a~0_280) .cse4 .cse5 (= |v_main_#t~pre9_5549| |v_main_#t~pre9_5585|) .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_280 v_main_~a~0_279) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre9_5585| |v_main_#t~pre9_5549|)))) InVars {main_~e~0=v_main_~e~0_3413, main_~d~0=v_main_~d~0_588, main_~b~0=v_main_~b~0_375, main_~f~0=v_main_~f~0_8314, main_#t~pre7=|v_main_#t~pre7_393|, main_~c~0=v_main_~c~0_486, main_#t~pre8=|v_main_#t~pre8_2868|, main_#t~pre9=|v_main_#t~pre9_5585|, main_#t~pre4=|v_main_#t~pre4_229|, main_#t~pre5=|v_main_#t~pre5_274|, main_~a~0=v_main_~a~0_280, main_#t~pre6=|v_main_#t~pre6_337|} OutVars{main_~e~0=v_main_~e~0_3406, main_~d~0=v_main_~d~0_586, main_~b~0=v_main_~b~0_373, main_~f~0=v_main_~f~0_8272, main_#t~pre7=|v_main_#t~pre7_392|, main_~c~0=v_main_~c~0_484, main_#t~pre8=|v_main_#t~pre8_2862|, main_#t~pre9=|v_main_#t~pre9_5549|, main_#t~pre4=|v_main_#t~pre4_228|, main_#t~pre5=|v_main_#t~pre5_273|, main_~a~0=v_main_~a~0_279, main_#t~pre6=|v_main_#t~pre6_336|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {29036#(= main_~a~0 0)} is VALID [2022-04-15 07:19:25,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {29036#(= main_~a~0 0)} [185] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {29032#false} is VALID [2022-04-15 07:19:25,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {29032#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {29032#false} is VALID [2022-04-15 07:19:25,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {29032#false} assume !false; {29032#false} is VALID [2022-04-15 07:19:25,141 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:19:25,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:25,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542426165] [2022-04-15 07:19:25,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542426165] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:25,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:25,142 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:27,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:27,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323844516] [2022-04-15 07:19:27,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323844516] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:27,109 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:27,109 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 07:19:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785758166] [2022-04-15 07:19:27,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:27,110 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 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 111 [2022-04-15 07:19:27,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:27,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:27,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:27,188 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 07:19:27,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:27,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 07:19:27,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=2359, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 07:19:27,189 INFO L87 Difference]: Start difference. First operand 114 states and 119 transitions. Second operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:33,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:33,850 INFO L93 Difference]: Finished difference Result 160 states and 184 transitions. [2022-04-15 07:19:33,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 07:19:33,850 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 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 111 [2022-04-15 07:19:33,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:19:33,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:33,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 184 transitions. [2022-04-15 07:19:33,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 184 transitions. [2022-04-15 07:19:33,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 184 transitions. [2022-04-15 07:19:33,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:33,995 INFO L225 Difference]: With dead ends: 160 [2022-04-15 07:19:33,995 INFO L226 Difference]: Without dead ends: 145 [2022-04-15 07:19:33,996 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 33 SyntacticMatches, 29 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1902 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=873, Invalid=9227, Unknown=0, NotChecked=0, Total=10100 [2022-04-15 07:19:33,996 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 289 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4470 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 4470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:19:33,996 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [289 Valid, 24 Invalid, 4671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 4470 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:19:33,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-04-15 07:19:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 118. [2022-04-15 07:19:34,079 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:19:34,079 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:34,079 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:34,079 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:34,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:34,080 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2022-04-15 07:19:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2022-04-15 07:19:34,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:34,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:34,081 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 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 145 states. [2022-04-15 07:19:34,081 INFO L87 Difference]: Start difference. First operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 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 145 states. [2022-04-15 07:19:34,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:19:34,082 INFO L93 Difference]: Finished difference Result 145 states and 162 transitions. [2022-04-15 07:19:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 162 transitions. [2022-04-15 07:19:34,082 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:19:34,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:19:34,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:19:34,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:19:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 114 states have (on average 1.0526315789473684) internal successors, (120), 114 states have internal predecessors, (120), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:34,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2022-04-15 07:19:34,083 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 111 [2022-04-15 07:19:34,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:19:34,083 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2022-04-15 07:19:34,084 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.076923076923077) internal successors, (108), 51 states have internal predecessors, (108), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:34,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 123 transitions. [2022-04-15 07:19:34,480 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:19:34,481 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2022-04-15 07:19:34,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 07:19:34,481 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:19:34,481 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:19:34,481 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-04-15 07:19:34,481 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:19:34,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:19:34,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1293042946, now seen corresponding path program 42 times [2022-04-15 07:19:34,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:34,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2143792937] [2022-04-15 07:19:39,300 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:39,336 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:19:39,417 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:19:39,442 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:19:39,442 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:19:39,529 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:19:42,435 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:42,480 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:19:42,572 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:19:42,598 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:19:42,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:19:42,687 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:19:46,775 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:46,819 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:19:46,910 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:19:46,935 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:19:46,936 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:19:47,013 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:19:51,092 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:51,138 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:19:51,255 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:19:51,279 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:19:51,279 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:19:51,364 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:19:55,446 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:19:55,489 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:19:55,577 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:19:55,825 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:19:55,825 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:19:55,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1834429739, now seen corresponding path program 1 times [2022-04-15 07:19:55,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:19:55,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647458086] [2022-04-15 07:19:55,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:19:55,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:19:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:55,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:19:55,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:19:55,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {30038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {30032#true} is VALID [2022-04-15 07:19:55,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {30032#true} assume true; {30032#true} is VALID [2022-04-15 07:19:55,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {30032#true} {30032#true} #92#return; {30032#true} is VALID [2022-04-15 07:19:55,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {30032#true} call ULTIMATE.init(); {30038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:19:55,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {30038#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {30032#true} is VALID [2022-04-15 07:19:55,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {30032#true} assume true; {30032#true} is VALID [2022-04-15 07:19:55,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30032#true} {30032#true} #92#return; {30032#true} is VALID [2022-04-15 07:19:55,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {30032#true} call #t~ret10 := main(); {30032#true} is VALID [2022-04-15 07:19:55,869 INFO L290 TraceCheckUtils]: 5: Hoare triple {30032#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {30037#(= main_~a~0 0)} is VALID [2022-04-15 07:19:55,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {30037#(= main_~a~0 0)} [188] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_234| |v_main_#t~pre4_233|)) (.cse1 (= v_main_~e~0_3516 v_main_~e~0_3508)) (.cse2 (= |v_main_#t~pre8_2928| |v_main_#t~pre8_2922|)) (.cse3 (= v_main_~a~0_286 v_main_~a~0_285)) (.cse4 (= v_main_~b~0_383 v_main_~b~0_381)) (.cse5 (= v_main_~c~0_496 v_main_~c~0_494)) (.cse6 (= v_main_~f~0_8597 v_main_~f~0_8555)) (.cse7 (= |v_main_#t~pre6_344| |v_main_#t~pre6_343|)) (.cse8 (= |v_main_#t~pre9_5771| |v_main_#t~pre9_5735|)) (.cse9 (= |v_main_#t~pre7_426| |v_main_#t~pre7_424|))) (or (and .cse0 .cse1 .cse2 (= v_main_~d~0_625 v_main_~d~0_628) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_279| |v_main_#t~pre5_280|) .cse9) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~d~0_628 v_main_~d~0_625) (= |v_main_#t~pre5_280| |v_main_#t~pre5_279|) .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3516, main_~d~0=v_main_~d~0_628, main_~b~0=v_main_~b~0_383, main_~f~0=v_main_~f~0_8597, main_#t~pre7=|v_main_#t~pre7_426|, main_~c~0=v_main_~c~0_496, main_#t~pre8=|v_main_#t~pre8_2928|, main_#t~pre9=|v_main_#t~pre9_5771|, main_#t~pre4=|v_main_#t~pre4_234|, main_#t~pre5=|v_main_#t~pre5_280|, main_~a~0=v_main_~a~0_286, main_#t~pre6=|v_main_#t~pre6_344|} OutVars{main_~e~0=v_main_~e~0_3508, main_~d~0=v_main_~d~0_625, main_~b~0=v_main_~b~0_381, main_~f~0=v_main_~f~0_8555, main_#t~pre7=|v_main_#t~pre7_424|, main_~c~0=v_main_~c~0_494, main_#t~pre8=|v_main_#t~pre8_2922|, main_#t~pre9=|v_main_#t~pre9_5735|, main_#t~pre4=|v_main_#t~pre4_233|, main_#t~pre5=|v_main_#t~pre5_279|, main_~a~0=v_main_~a~0_285, main_#t~pre6=|v_main_#t~pre6_343|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {30037#(= main_~a~0 0)} is VALID [2022-04-15 07:19:55,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {30037#(= main_~a~0 0)} [187] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {30033#false} is VALID [2022-04-15 07:19:55,870 INFO L290 TraceCheckUtils]: 8: Hoare triple {30033#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {30033#false} is VALID [2022-04-15 07:19:55,870 INFO L290 TraceCheckUtils]: 9: Hoare triple {30033#false} assume !false; {30033#false} is VALID [2022-04-15 07:19:55,870 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:19:55,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:19:55,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647458086] [2022-04-15 07:19:55,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647458086] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:55,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:55,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:19:57,471 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:19:57,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2143792937] [2022-04-15 07:19:57,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2143792937] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:19:57,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:19:57,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 07:19:57,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933822826] [2022-04-15 07:19:57,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:19:57,472 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 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 114 [2022-04-15 07:19:57,472 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:19:57,472 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:19:57,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:19:57,525 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 07:19:57,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:19:57,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 07:19:57,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=298, Invalid=2458, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 07:19:57,526 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:02,577 INFO L93 Difference]: Finished difference Result 161 states and 184 transitions. [2022-04-15 07:20:02,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 07:20:02,577 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 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 114 [2022-04-15 07:20:02,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:02,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 184 transitions. [2022-04-15 07:20:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 184 transitions. [2022-04-15 07:20:02,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 184 transitions. [2022-04-15 07:20:02,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:02,676 INFO L225 Difference]: With dead ends: 161 [2022-04-15 07:20:02,676 INFO L226 Difference]: Without dead ends: 146 [2022-04-15 07:20:02,677 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 38 SyntacticMatches, 26 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2017 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=888, Invalid=9618, Unknown=0, NotChecked=0, Total=10506 [2022-04-15 07:20:02,677 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 220 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 4238 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 4354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 4238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:02,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [220 Valid, 64 Invalid, 4354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 4238 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-15 07:20:02,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-15 07:20:02,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2022-04-15 07:20:02,762 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:02,762 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,762 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,762 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:02,763 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2022-04-15 07:20:02,763 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2022-04-15 07:20:02,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:02,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:02,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 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 146 states. [2022-04-15 07:20:02,766 INFO L87 Difference]: Start difference. First operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 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 146 states. [2022-04-15 07:20:02,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:02,767 INFO L93 Difference]: Finished difference Result 146 states and 163 transitions. [2022-04-15 07:20:02,767 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 163 transitions. [2022-04-15 07:20:02,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:02,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:02,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:02,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:02,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 115 states have (on average 1.0521739130434782) internal successors, (121), 115 states have internal predecessors, (121), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2022-04-15 07:20:02,768 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 114 [2022-04-15 07:20:02,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:02,769 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2022-04-15 07:20:02,769 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:02,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 124 transitions. [2022-04-15 07:20:03,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:03,157 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2022-04-15 07:20:03,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 07:20:03,157 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:03,158 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:03,158 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2022-04-15 07:20:03,158 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:03,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:03,158 INFO L85 PathProgramCache]: Analyzing trace with hash -361153865, now seen corresponding path program 43 times [2022-04-15 07:20:03,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:03,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [832239474] [2022-04-15 07:20:04,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:04,045 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:04,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:04,045 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:04,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:04,045 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:04,045 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:04,045 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:04,186 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:04,187 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:04,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1834491243, now seen corresponding path program 1 times [2022-04-15 07:20:04,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:04,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613701182] [2022-04-15 07:20:04,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:04,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:04,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:04,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:04,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:04,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {31048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {31042#true} assume true; {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31042#true} {31042#true} #92#return; {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L272 TraceCheckUtils]: 0: Hoare triple {31042#true} call ULTIMATE.init(); {31048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:04,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {31048#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {31042#true} assume true; {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31042#true} {31042#true} #92#return; {31042#true} is VALID [2022-04-15 07:20:04,227 INFO L272 TraceCheckUtils]: 4: Hoare triple {31042#true} call #t~ret10 := main(); {31042#true} is VALID [2022-04-15 07:20:04,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {31042#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {31047#(= main_~a~0 0)} is VALID [2022-04-15 07:20:04,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {31047#(= main_~a~0 0)} [190] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_3576 v_main_~e~0_3567)) (.cse1 (= |v_main_#t~pre8_2965| |v_main_#t~pre8_2958|)) (.cse2 (= v_main_~a~0_292 v_main_~a~0_291)) (.cse3 (= |v_main_#t~pre6_351| |v_main_#t~pre6_350|)) (.cse4 (= v_main_~f~0_8833 v_main_~f~0_8790)) (.cse5 (= |v_main_#t~pre5_286| |v_main_#t~pre5_285|)) (.cse6 (= |v_main_#t~pre9_5928| |v_main_#t~pre9_5892|)) (.cse7 (= |v_main_#t~pre4_239| |v_main_#t~pre4_238|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_440| |v_main_#t~pre7_438|) (= v_main_~c~0_506 v_main_~c~0_504) (= v_main_~d~0_650 v_main_~d~0_647) .cse3 (= v_main_~b~0_391 v_main_~b~0_389) .cse4 .cse5 .cse6 .cse7) (and .cse0 (= v_main_~b~0_389 v_main_~b~0_391) .cse1 .cse2 (= v_main_~c~0_504 v_main_~c~0_506) (= v_main_~d~0_647 v_main_~d~0_650) .cse3 .cse4 (= |v_main_#t~pre7_438| |v_main_#t~pre7_440|) .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_3576, main_~d~0=v_main_~d~0_650, main_~b~0=v_main_~b~0_391, main_~f~0=v_main_~f~0_8833, main_#t~pre7=|v_main_#t~pre7_440|, main_~c~0=v_main_~c~0_506, main_#t~pre8=|v_main_#t~pre8_2965|, main_#t~pre9=|v_main_#t~pre9_5928|, main_#t~pre4=|v_main_#t~pre4_239|, main_#t~pre5=|v_main_#t~pre5_286|, main_~a~0=v_main_~a~0_292, main_#t~pre6=|v_main_#t~pre6_351|} OutVars{main_~e~0=v_main_~e~0_3567, main_~d~0=v_main_~d~0_647, main_~b~0=v_main_~b~0_389, main_~f~0=v_main_~f~0_8790, main_#t~pre7=|v_main_#t~pre7_438|, main_~c~0=v_main_~c~0_504, main_#t~pre8=|v_main_#t~pre8_2958|, main_#t~pre9=|v_main_#t~pre9_5892|, main_#t~pre4=|v_main_#t~pre4_238|, main_#t~pre5=|v_main_#t~pre5_285|, main_~a~0=v_main_~a~0_291, main_#t~pre6=|v_main_#t~pre6_350|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {31047#(= main_~a~0 0)} is VALID [2022-04-15 07:20:04,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {31047#(= main_~a~0 0)} [189] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {31043#false} is VALID [2022-04-15 07:20:04,228 INFO L290 TraceCheckUtils]: 8: Hoare triple {31043#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {31043#false} is VALID [2022-04-15 07:20:04,228 INFO L290 TraceCheckUtils]: 9: Hoare triple {31043#false} assume !false; {31043#false} is VALID [2022-04-15 07:20:04,228 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:20:04,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:04,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613701182] [2022-04-15 07:20:04,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613701182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:04,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:04,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:05,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:05,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [832239474] [2022-04-15 07:20:05,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [832239474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:05,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:05,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 07:20:05,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620502098] [2022-04-15 07:20:05,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:05,890 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 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 117 [2022-04-15 07:20:05,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:05,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:05,942 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:20:05,942 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 07:20:05,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:05,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 07:20:05,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=2559, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 07:20:05,943 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:11,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:11,941 INFO L93 Difference]: Finished difference Result 163 states and 186 transitions. [2022-04-15 07:20:11,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 07:20:11,941 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 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 117 [2022-04-15 07:20:11,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:11,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:11,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 186 transitions. [2022-04-15 07:20:11,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:11,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 186 transitions. [2022-04-15 07:20:11,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 186 transitions. [2022-04-15 07:20:12,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:12,041 INFO L225 Difference]: With dead ends: 163 [2022-04-15 07:20:12,041 INFO L226 Difference]: Without dead ends: 148 [2022-04-15 07:20:12,042 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 46 SyntacticMatches, 20 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2126 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=903, Invalid=10017, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 07:20:12,042 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 267 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 4689 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 4689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:12,042 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [267 Valid, 99 Invalid, 4855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 4689 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-04-15 07:20:12,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-15 07:20:12,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 120. [2022-04-15 07:20:12,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:12,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:12,134 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:12,134 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:12,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:12,135 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-04-15 07:20:12,135 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2022-04-15 07:20:12,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:12,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:12,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 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 148 states. [2022-04-15 07:20:12,136 INFO L87 Difference]: Start difference. First operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 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 148 states. [2022-04-15 07:20:12,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:12,137 INFO L93 Difference]: Finished difference Result 148 states and 165 transitions. [2022-04-15 07:20:12,137 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 165 transitions. [2022-04-15 07:20:12,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:12,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:12,137 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:12,137 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:12,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 116 states have (on average 1.0517241379310345) internal successors, (122), 116 states have internal predecessors, (122), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:12,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2022-04-15 07:20:12,138 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 117 [2022-04-15 07:20:12,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:12,140 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2022-04-15 07:20:12,141 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.111111111111111) internal successors, (114), 53 states have internal predecessors, (114), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:12,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 125 transitions. [2022-04-15 07:20:12,545 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:12,545 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2022-04-15 07:20:12,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 07:20:12,545 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:12,545 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:12,545 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2022-04-15 07:20:12,547 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:12,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:12,547 INFO L85 PathProgramCache]: Analyzing trace with hash 739296469, now seen corresponding path program 44 times [2022-04-15 07:20:12,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:12,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050131320] [2022-04-15 07:20:17,501 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:17,567 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:20:17,663 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:20:17,706 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:20:20,467 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:20,532 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:20:20,628 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:20:20,672 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:20:24,168 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:24,237 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:20:24,333 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:20:24,377 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:20:26,876 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-15 07:20:26,934 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:20:27,019 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:20:27,058 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:20:27,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:27,288 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:27,288 INFO L85 PathProgramCache]: Analyzing trace with hash 1834552747, now seen corresponding path program 1 times [2022-04-15 07:20:27,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:27,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2993703] [2022-04-15 07:20:27,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:27,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:27,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:27,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:27,332 INFO L290 TraceCheckUtils]: 0: Hoare triple {32071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {32065#true} is VALID [2022-04-15 07:20:27,332 INFO L290 TraceCheckUtils]: 1: Hoare triple {32065#true} assume true; {32065#true} is VALID [2022-04-15 07:20:27,332 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32065#true} {32065#true} #92#return; {32065#true} is VALID [2022-04-15 07:20:27,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {32065#true} call ULTIMATE.init(); {32071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:27,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {32071#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {32065#true} is VALID [2022-04-15 07:20:27,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {32065#true} assume true; {32065#true} is VALID [2022-04-15 07:20:27,333 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32065#true} {32065#true} #92#return; {32065#true} is VALID [2022-04-15 07:20:27,333 INFO L272 TraceCheckUtils]: 4: Hoare triple {32065#true} call #t~ret10 := main(); {32065#true} is VALID [2022-04-15 07:20:27,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {32065#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {32070#(= main_~a~0 0)} is VALID [2022-04-15 07:20:27,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {32070#(= main_~a~0 0)} [192] L23-3-->L23-4_primed: Formula: (and (= v_main_~d~0_694 v_main_~d~0_691) (= |v_main_#t~pre4_244| |v_main_#t~pre4_243|) (= v_main_~b~0_399 v_main_~b~0_397) (= v_main_~c~0_516 v_main_~c~0_514) (= v_main_~a~0_298 v_main_~a~0_297) (= |v_main_#t~pre7_475| |v_main_#t~pre7_473|) (= |v_main_#t~pre9_6131| |v_main_#t~pre9_6094|) (= v_main_~f~0_9118 v_main_~f~0_9074) (= |v_main_#t~pre5_292| |v_main_#t~pre5_291|) (= |v_main_#t~pre8_3043| |v_main_#t~pre8_3036|) (= |v_main_#t~pre6_358| |v_main_#t~pre6_357|) (= v_main_~e~0_3699 v_main_~e~0_3690)) InVars {main_~e~0=v_main_~e~0_3699, main_~d~0=v_main_~d~0_694, main_~b~0=v_main_~b~0_399, main_~f~0=v_main_~f~0_9118, main_#t~pre7=|v_main_#t~pre7_475|, main_~c~0=v_main_~c~0_516, main_#t~pre8=|v_main_#t~pre8_3043|, main_#t~pre9=|v_main_#t~pre9_6131|, main_#t~pre4=|v_main_#t~pre4_244|, main_#t~pre5=|v_main_#t~pre5_292|, main_~a~0=v_main_~a~0_298, main_#t~pre6=|v_main_#t~pre6_358|} OutVars{main_~e~0=v_main_~e~0_3690, main_~d~0=v_main_~d~0_691, main_~b~0=v_main_~b~0_397, main_~f~0=v_main_~f~0_9074, main_#t~pre7=|v_main_#t~pre7_473|, main_~c~0=v_main_~c~0_514, main_#t~pre8=|v_main_#t~pre8_3036|, main_#t~pre9=|v_main_#t~pre9_6094|, main_#t~pre4=|v_main_#t~pre4_243|, main_#t~pre5=|v_main_#t~pre5_291|, main_~a~0=v_main_~a~0_297, main_#t~pre6=|v_main_#t~pre6_357|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {32070#(= main_~a~0 0)} is VALID [2022-04-15 07:20:27,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {32070#(= main_~a~0 0)} [191] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {32066#false} is VALID [2022-04-15 07:20:27,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {32066#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {32066#false} is VALID [2022-04-15 07:20:27,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {32066#false} assume !false; {32066#false} is VALID [2022-04-15 07:20:27,334 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:20:27,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:27,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2993703] [2022-04-15 07:20:27,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2993703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:27,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:27,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:29,170 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050131320] [2022-04-15 07:20:29,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050131320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:29,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:29,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 07:20:29,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888175971] [2022-04-15 07:20:29,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:29,171 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 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 119 [2022-04-15 07:20:29,171 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:29,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:29,225 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:20:29,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 07:20:29,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:29,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 07:20:29,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=2662, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 07:20:29,226 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:35,149 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-04-15 07:20:35,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 07:20:35,150 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 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 119 [2022-04-15 07:20:35,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:35,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 188 transitions. [2022-04-15 07:20:35,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 188 transitions. [2022-04-15 07:20:35,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 188 transitions. [2022-04-15 07:20:35,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:35,245 INFO L225 Difference]: With dead ends: 165 [2022-04-15 07:20:35,245 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 07:20:35,246 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 38 SyntacticMatches, 29 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2313 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=918, Invalid=10424, Unknown=0, NotChecked=0, Total=11342 [2022-04-15 07:20:35,246 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 243 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 4495 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 4651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 4495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:35,246 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 89 Invalid, 4651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 4495 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 07:20:35,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 07:20:35,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 122. [2022-04-15 07:20:35,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:35,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,335 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,335 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:35,336 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-04-15 07:20:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-04-15 07:20:35,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:35,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:35,337 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 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 150 states. [2022-04-15 07:20:35,337 INFO L87 Difference]: Start difference. First operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 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 150 states. [2022-04-15 07:20:35,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:35,338 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-04-15 07:20:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-04-15 07:20:35,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:35,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:35,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:35,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:35,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 118 states have (on average 1.0508474576271187) internal successors, (124), 118 states have internal predecessors, (124), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2022-04-15 07:20:35,339 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 119 [2022-04-15 07:20:35,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:35,339 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2022-04-15 07:20:35,339 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.109090909090909) internal successors, (116), 54 states have internal predecessors, (116), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:35,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 127 transitions. [2022-04-15 07:20:35,739 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:35,739 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2022-04-15 07:20:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 07:20:35,740 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:35,740 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:35,740 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable49 [2022-04-15 07:20:35,740 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:35,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:35,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1710112627, now seen corresponding path program 45 times [2022-04-15 07:20:35,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:35,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258370530] [2022-04-15 07:20:36,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:36,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:36,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:36,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:36,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:36,453 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:36,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:36,453 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:36,593 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:36,594 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:36,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1834614251, now seen corresponding path program 1 times [2022-04-15 07:20:36,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:36,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1382695447] [2022-04-15 07:20:36,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:36,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:36,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:36,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:36,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {33109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {33103#true} assume true; {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33103#true} {33103#true} #92#return; {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {33103#true} call ULTIMATE.init(); {33109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:36,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {33109#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {33103#true} assume true; {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33103#true} {33103#true} #92#return; {33103#true} is VALID [2022-04-15 07:20:36,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {33103#true} call #t~ret10 := main(); {33103#true} is VALID [2022-04-15 07:20:36,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {33103#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {33108#(= main_~a~0 0)} is VALID [2022-04-15 07:20:36,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {33108#(= main_~a~0 0)} [194] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_304 v_main_~a~0_303)) (.cse1 (= |v_main_#t~pre9_6299| |v_main_#t~pre9_6261|)) (.cse2 (= |v_main_#t~pre7_490| |v_main_#t~pre7_488|)) (.cse3 (= v_main_~f~0_9369 v_main_~f~0_9324)) (.cse4 (= |v_main_#t~pre4_249| |v_main_#t~pre4_248|)) (.cse5 (= v_main_~c~0_526 v_main_~c~0_524)) (.cse6 (= |v_main_#t~pre6_365| |v_main_#t~pre6_364|)) (.cse7 (= v_main_~d~0_718 v_main_~d~0_715)) (.cse8 (= v_main_~b~0_407 v_main_~b~0_405)) (.cse9 (= |v_main_#t~pre8_3081| |v_main_#t~pre8_3074|)) (.cse10 (= |v_main_#t~pre5_298| |v_main_#t~pre5_297|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (= v_main_~e~0_3753 v_main_~e~0_3762) .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~e~0_3762 v_main_~e~0_3753) .cse5 .cse6 .cse7 .cse8 .cse9 .cse10))) InVars {main_~e~0=v_main_~e~0_3762, main_~d~0=v_main_~d~0_718, main_~b~0=v_main_~b~0_407, main_~f~0=v_main_~f~0_9369, main_#t~pre7=|v_main_#t~pre7_490|, main_~c~0=v_main_~c~0_526, main_#t~pre8=|v_main_#t~pre8_3081|, main_#t~pre9=|v_main_#t~pre9_6299|, main_#t~pre4=|v_main_#t~pre4_249|, main_#t~pre5=|v_main_#t~pre5_298|, main_~a~0=v_main_~a~0_304, main_#t~pre6=|v_main_#t~pre6_365|} OutVars{main_~e~0=v_main_~e~0_3753, main_~d~0=v_main_~d~0_715, main_~b~0=v_main_~b~0_405, main_~f~0=v_main_~f~0_9324, main_#t~pre7=|v_main_#t~pre7_488|, main_~c~0=v_main_~c~0_524, main_#t~pre8=|v_main_#t~pre8_3074|, main_#t~pre9=|v_main_#t~pre9_6261|, main_#t~pre4=|v_main_#t~pre4_248|, main_#t~pre5=|v_main_#t~pre5_297|, main_~a~0=v_main_~a~0_303, main_#t~pre6=|v_main_#t~pre6_364|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {33108#(= main_~a~0 0)} is VALID [2022-04-15 07:20:36,643 INFO L290 TraceCheckUtils]: 7: Hoare triple {33108#(= main_~a~0 0)} [193] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {33104#false} is VALID [2022-04-15 07:20:36,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {33104#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {33104#false} is VALID [2022-04-15 07:20:36,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {33104#false} assume !false; {33104#false} is VALID [2022-04-15 07:20:36,643 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:20:36,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:36,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1382695447] [2022-04-15 07:20:36,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1382695447] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:36,644 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:36,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:38,033 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:38,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258370530] [2022-04-15 07:20:38,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258370530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:38,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:38,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 07:20:38,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61966564] [2022-04-15 07:20:38,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:38,034 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 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 121 [2022-04-15 07:20:38,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:38,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:38,120 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:20:38,121 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 07:20:38,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:38,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 07:20:38,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=2767, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 07:20:38,121 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:43,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:43,913 INFO L93 Difference]: Finished difference Result 167 states and 190 transitions. [2022-04-15 07:20:43,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 07:20:43,914 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 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 121 [2022-04-15 07:20:43,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:43,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:43,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 190 transitions. [2022-04-15 07:20:43,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:43,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 190 transitions. [2022-04-15 07:20:43,916 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 190 transitions. [2022-04-15 07:20:44,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:44,013 INFO L225 Difference]: With dead ends: 167 [2022-04-15 07:20:44,013 INFO L226 Difference]: Without dead ends: 152 [2022-04-15 07:20:44,013 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 51 SyntacticMatches, 17 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2405 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=933, Invalid=10839, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 07:20:44,014 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 286 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 4568 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 4746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 4568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:44,014 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 39 Invalid, 4746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 4568 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-15 07:20:44,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-04-15 07:20:44,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 124. [2022-04-15 07:20:44,105 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:44,105 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:44,105 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:44,105 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:44,106 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2022-04-15 07:20:44,106 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2022-04-15 07:20:44,106 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:44,106 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:44,106 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 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 152 states. [2022-04-15 07:20:44,107 INFO L87 Difference]: Start difference. First operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 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 152 states. [2022-04-15 07:20:44,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:44,108 INFO L93 Difference]: Finished difference Result 152 states and 169 transitions. [2022-04-15 07:20:44,108 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 169 transitions. [2022-04-15 07:20:44,108 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:44,108 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:44,108 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:44,108 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:44,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 120 states have (on average 1.05) internal successors, (126), 120 states have internal predecessors, (126), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:44,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-04-15 07:20:44,109 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 121 [2022-04-15 07:20:44,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:44,109 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-04-15 07:20:44,109 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.107142857142857) internal successors, (118), 55 states have internal predecessors, (118), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:44,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 129 transitions. [2022-04-15 07:20:44,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:44,567 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-04-15 07:20:44,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 07:20:44,568 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:44,568 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:44,568 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2022-04-15 07:20:44,568 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:44,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:44,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1638430063, now seen corresponding path program 46 times [2022-04-15 07:20:44,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:44,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2010153766] [2022-04-15 07:20:45,540 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:45,540 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:45,541 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:45,541 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:45,541 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:45,541 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:45,541 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:45,541 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:45,761 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:45,761 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:45,762 INFO L85 PathProgramCache]: Analyzing trace with hash 1834675755, now seen corresponding path program 1 times [2022-04-15 07:20:45,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:45,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973490513] [2022-04-15 07:20:45,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:45,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:45,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:45,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:45,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {34162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {34156#true} is VALID [2022-04-15 07:20:45,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {34156#true} assume true; {34156#true} is VALID [2022-04-15 07:20:45,815 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34156#true} {34156#true} #92#return; {34156#true} is VALID [2022-04-15 07:20:45,816 INFO L272 TraceCheckUtils]: 0: Hoare triple {34156#true} call ULTIMATE.init(); {34162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:45,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {34162#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {34156#true} is VALID [2022-04-15 07:20:45,816 INFO L290 TraceCheckUtils]: 2: Hoare triple {34156#true} assume true; {34156#true} is VALID [2022-04-15 07:20:45,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34156#true} {34156#true} #92#return; {34156#true} is VALID [2022-04-15 07:20:45,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {34156#true} call #t~ret10 := main(); {34156#true} is VALID [2022-04-15 07:20:45,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {34156#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {34161#(= main_~a~0 0)} is VALID [2022-04-15 07:20:45,817 INFO L290 TraceCheckUtils]: 6: Hoare triple {34161#(= main_~a~0 0)} [196] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~d~0_742 v_main_~d~0_739)) (.cse1 (= |v_main_#t~pre5_304| |v_main_#t~pre5_303|)) (.cse2 (= |v_main_#t~pre6_372| |v_main_#t~pre6_371|)) (.cse3 (= |v_main_#t~pre4_254| |v_main_#t~pre4_253|)) (.cse4 (= v_main_~f~0_9626 v_main_~f~0_9580)) (.cse5 (= |v_main_#t~pre9_6472| |v_main_#t~pre9_6433|)) (.cse6 (= |v_main_#t~pre7_505| |v_main_#t~pre7_503|)) (.cse7 (= |v_main_#t~pre8_3119| |v_main_#t~pre8_3112|)) (.cse8 (= v_main_~c~0_536 v_main_~c~0_534)) (.cse9 (= v_main_~b~0_415 v_main_~b~0_413))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_309 v_main_~a~0_310) .cse5 .cse6 .cse7 .cse8 (= v_main_~e~0_3816 v_main_~e~0_3825) .cse9) (and (= v_main_~e~0_3825 v_main_~e~0_3816) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~a~0_310 v_main_~a~0_309) .cse9))) InVars {main_~e~0=v_main_~e~0_3825, main_~d~0=v_main_~d~0_742, main_~b~0=v_main_~b~0_415, main_~f~0=v_main_~f~0_9626, main_#t~pre7=|v_main_#t~pre7_505|, main_~c~0=v_main_~c~0_536, main_#t~pre8=|v_main_#t~pre8_3119|, main_#t~pre9=|v_main_#t~pre9_6472|, main_#t~pre4=|v_main_#t~pre4_254|, main_#t~pre5=|v_main_#t~pre5_304|, main_~a~0=v_main_~a~0_310, main_#t~pre6=|v_main_#t~pre6_372|} OutVars{main_~e~0=v_main_~e~0_3816, main_~d~0=v_main_~d~0_739, main_~b~0=v_main_~b~0_413, main_~f~0=v_main_~f~0_9580, main_#t~pre7=|v_main_#t~pre7_503|, main_~c~0=v_main_~c~0_534, main_#t~pre8=|v_main_#t~pre8_3112|, main_#t~pre9=|v_main_#t~pre9_6433|, main_#t~pre4=|v_main_#t~pre4_253|, main_#t~pre5=|v_main_#t~pre5_303|, main_~a~0=v_main_~a~0_309, main_#t~pre6=|v_main_#t~pre6_371|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {34161#(= main_~a~0 0)} is VALID [2022-04-15 07:20:45,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {34161#(= main_~a~0 0)} [195] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {34157#false} is VALID [2022-04-15 07:20:45,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {34157#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {34157#false} is VALID [2022-04-15 07:20:45,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {34157#false} assume !false; {34157#false} is VALID [2022-04-15 07:20:45,817 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:20:45,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:45,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973490513] [2022-04-15 07:20:45,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973490513] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:45,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:45,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:48,062 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:48,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2010153766] [2022-04-15 07:20:48,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2010153766] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:48,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:48,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 07:20:48,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652313520] [2022-04-15 07:20:48,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:48,063 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 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 123 [2022-04-15 07:20:48,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:48,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:48,148 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:20:48,148 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 07:20:48,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:48,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 07:20:48,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=318, Invalid=2874, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 07:20:48,149 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:54,741 INFO L93 Difference]: Finished difference Result 169 states and 192 transitions. [2022-04-15 07:20:54,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 07:20:54,741 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 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 123 [2022-04-15 07:20:54,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:20:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 192 transitions. [2022-04-15 07:20:54,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 192 transitions. [2022-04-15 07:20:54,744 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 192 transitions. [2022-04-15 07:20:54,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:54,835 INFO L225 Difference]: With dead ends: 169 [2022-04-15 07:20:54,835 INFO L226 Difference]: Without dead ends: 154 [2022-04-15 07:20:54,836 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 40 SyntacticMatches, 29 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2615 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=948, Invalid=11262, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 07:20:54,836 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 309 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5245 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 5466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 5245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:20:54,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [309 Valid, 39 Invalid, 5466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 5245 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:20:54,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-04-15 07:20:54,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 126. [2022-04-15 07:20:54,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:20:54,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 154 states. Second operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,938 INFO L74 IsIncluded]: Start isIncluded. First operand 154 states. Second operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,938 INFO L87 Difference]: Start difference. First operand 154 states. Second operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:54,940 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2022-04-15 07:20:54,940 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2022-04-15 07:20:54,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:54,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:54,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 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 154 states. [2022-04-15 07:20:54,940 INFO L87 Difference]: Start difference. First operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 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 154 states. [2022-04-15 07:20:54,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:20:54,941 INFO L93 Difference]: Finished difference Result 154 states and 171 transitions. [2022-04-15 07:20:54,941 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 171 transitions. [2022-04-15 07:20:54,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:20:54,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:20:54,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:20:54,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:20:54,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 122 states have (on average 1.0491803278688525) internal successors, (128), 122 states have internal predecessors, (128), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-04-15 07:20:54,943 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 123 [2022-04-15 07:20:54,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:20:54,943 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-04-15 07:20:54,943 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.1052631578947367) internal successors, (120), 56 states have internal predecessors, (120), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:54,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 131 transitions. [2022-04-15 07:20:55,377 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:55,377 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-04-15 07:20:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 07:20:55,378 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:20:55,378 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:20:55,378 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2022-04-15 07:20:55,378 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:20:55,378 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:20:55,378 INFO L85 PathProgramCache]: Analyzing trace with hash 1637516847, now seen corresponding path program 47 times [2022-04-15 07:20:55,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:55,378 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2146149322] [2022-04-15 07:20:56,034 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:56,034 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:56,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:56,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:56,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:56,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:56,035 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:20:56,035 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:20:56,170 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:20:56,170 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:20:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1834737259, now seen corresponding path program 1 times [2022-04-15 07:20:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:20:56,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677612055] [2022-04-15 07:20:56,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:20:56,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:20:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:56,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:20:56,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:20:56,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {35230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35224#true} {35224#true} #92#return; {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L272 TraceCheckUtils]: 0: Hoare triple {35224#true} call ULTIMATE.init(); {35230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:20:56,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {35230#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {35224#true} assume true; {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35224#true} {35224#true} #92#return; {35224#true} is VALID [2022-04-15 07:20:56,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {35224#true} call #t~ret10 := main(); {35224#true} is VALID [2022-04-15 07:20:56,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {35224#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {35229#(= main_~a~0 0)} is VALID [2022-04-15 07:20:56,218 INFO L290 TraceCheckUtils]: 6: Hoare triple {35229#(= main_~a~0 0)} [198] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_316 v_main_~a~0_315)) (.cse1 (= v_main_~d~0_766 v_main_~d~0_763)) (.cse2 (= |v_main_#t~pre9_6650| |v_main_#t~pre9_6610|)) (.cse3 (= |v_main_#t~pre6_379| |v_main_#t~pre6_378|)) (.cse4 (= v_main_~c~0_546 v_main_~c~0_544)) (.cse5 (= |v_main_#t~pre5_310| |v_main_#t~pre5_309|)) (.cse6 (= |v_main_#t~pre8_3157| |v_main_#t~pre8_3150|)) (.cse7 (= v_main_~b~0_423 v_main_~b~0_421)) (.cse8 (= |v_main_#t~pre4_259| |v_main_#t~pre4_258|)) (.cse9 (= v_main_~f~0_9889 v_main_~f~0_9842))) (or (and .cse0 (= |v_main_#t~pre7_520| |v_main_#t~pre7_518|) .cse1 .cse2 (= v_main_~e~0_3888 v_main_~e~0_3879) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and (= |v_main_#t~pre7_518| |v_main_#t~pre7_520|) .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_3879 v_main_~e~0_3888) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_3888, main_~d~0=v_main_~d~0_766, main_~b~0=v_main_~b~0_423, main_~f~0=v_main_~f~0_9889, main_#t~pre7=|v_main_#t~pre7_520|, main_~c~0=v_main_~c~0_546, main_#t~pre8=|v_main_#t~pre8_3157|, main_#t~pre9=|v_main_#t~pre9_6650|, main_#t~pre4=|v_main_#t~pre4_259|, main_#t~pre5=|v_main_#t~pre5_310|, main_~a~0=v_main_~a~0_316, main_#t~pre6=|v_main_#t~pre6_379|} OutVars{main_~e~0=v_main_~e~0_3879, main_~d~0=v_main_~d~0_763, main_~b~0=v_main_~b~0_421, main_~f~0=v_main_~f~0_9842, main_#t~pre7=|v_main_#t~pre7_518|, main_~c~0=v_main_~c~0_544, main_#t~pre8=|v_main_#t~pre8_3150|, main_#t~pre9=|v_main_#t~pre9_6610|, main_#t~pre4=|v_main_#t~pre4_258|, main_#t~pre5=|v_main_#t~pre5_309|, main_~a~0=v_main_~a~0_315, main_#t~pre6=|v_main_#t~pre6_378|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {35229#(= main_~a~0 0)} is VALID [2022-04-15 07:20:56,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {35229#(= main_~a~0 0)} [197] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {35225#false} is VALID [2022-04-15 07:20:56,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {35225#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {35225#false} is VALID [2022-04-15 07:20:56,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {35225#false} assume !false; {35225#false} is VALID [2022-04-15 07:20:56,225 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:20:56,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:20:56,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677612055] [2022-04-15 07:20:56,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677612055] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:56,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:56,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:20:57,763 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:20:57,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2146149322] [2022-04-15 07:20:57,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2146149322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:20:57,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:20:57,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 07:20:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198443686] [2022-04-15 07:20:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:20:57,764 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 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 125 [2022-04-15 07:20:57,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:20:57,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:20:57,818 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:20:57,818 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 07:20:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:20:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 07:20:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=2983, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 07:20:57,819 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:03,522 INFO L93 Difference]: Finished difference Result 171 states and 194 transitions. [2022-04-15 07:21:03,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 07:21:03,522 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 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 125 [2022-04-15 07:21:03,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:03,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 194 transitions. [2022-04-15 07:21:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 194 transitions. [2022-04-15 07:21:03,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 194 transitions. [2022-04-15 07:21:03,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:03,619 INFO L225 Difference]: With dead ends: 171 [2022-04-15 07:21:03,619 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 07:21:03,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 43 SyntacticMatches, 27 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2779 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=963, Invalid=11693, Unknown=0, NotChecked=0, Total=12656 [2022-04-15 07:21:03,620 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 359 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 4748 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 5010 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 4748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:03,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 44 Invalid, 5010 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 4748 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-15 07:21:03,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 07:21:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 128. [2022-04-15 07:21:03,720 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:03,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,720 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,720 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:03,722 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-04-15 07:21:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2022-04-15 07:21:03,722 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:03,722 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:03,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 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 156 states. [2022-04-15 07:21:03,722 INFO L87 Difference]: Start difference. First operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 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 156 states. [2022-04-15 07:21:03,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:03,723 INFO L93 Difference]: Finished difference Result 156 states and 173 transitions. [2022-04-15 07:21:03,723 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 173 transitions. [2022-04-15 07:21:03,723 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:03,723 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:03,723 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:03,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:03,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 124 states have (on average 1.0483870967741935) internal successors, (130), 124 states have internal predecessors, (130), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-04-15 07:21:03,725 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 125 [2022-04-15 07:21:03,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:03,725 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-04-15 07:21:03,725 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.103448275862069) internal successors, (122), 57 states have internal predecessors, (122), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:03,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 133 transitions. [2022-04-15 07:21:04,183 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-04-15 07:21:04,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 07:21:04,184 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:04,184 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:04,184 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52 [2022-04-15 07:21:04,184 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:04,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:04,184 INFO L85 PathProgramCache]: Analyzing trace with hash 1611469389, now seen corresponding path program 48 times [2022-04-15 07:21:04,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:04,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [800508218] [2022-04-15 07:21:05,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:05,016 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:05,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:05,016 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:05,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:05,016 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:05,016 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:05,017 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:05,232 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:21:05,232 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:21:05,233 INFO L85 PathProgramCache]: Analyzing trace with hash 1834798763, now seen corresponding path program 1 times [2022-04-15 07:21:05,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:05,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818038258] [2022-04-15 07:21:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:05,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:05,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:05,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:05,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:05,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {36313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36307#true} is VALID [2022-04-15 07:21:05,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {36307#true} assume true; {36307#true} is VALID [2022-04-15 07:21:05,278 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36307#true} {36307#true} #92#return; {36307#true} is VALID [2022-04-15 07:21:05,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {36307#true} call ULTIMATE.init(); {36313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:05,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {36313#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {36307#true} is VALID [2022-04-15 07:21:05,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {36307#true} assume true; {36307#true} is VALID [2022-04-15 07:21:05,279 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36307#true} {36307#true} #92#return; {36307#true} is VALID [2022-04-15 07:21:05,279 INFO L272 TraceCheckUtils]: 4: Hoare triple {36307#true} call #t~ret10 := main(); {36307#true} is VALID [2022-04-15 07:21:05,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {36307#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {36312#(= main_~a~0 0)} is VALID [2022-04-15 07:21:05,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {36312#(= main_~a~0 0)} [200] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~e~0_3951 v_main_~e~0_3942)) (.cse1 (= v_main_~f~0_10158 v_main_~f~0_10110)) (.cse2 (= |v_main_#t~pre5_316| |v_main_#t~pre5_315|)) (.cse3 (= |v_main_#t~pre7_535| |v_main_#t~pre7_533|)) (.cse4 (= v_main_~c~0_556 v_main_~c~0_554)) (.cse5 (= |v_main_#t~pre9_6833| |v_main_#t~pre9_6792|)) (.cse6 (= v_main_~a~0_322 v_main_~a~0_321)) (.cse7 (= |v_main_#t~pre6_386| |v_main_#t~pre6_385|)) (.cse8 (= |v_main_#t~pre4_264| |v_main_#t~pre4_263|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre8_3188| |v_main_#t~pre8_3195|) (= v_main_~b~0_429 v_main_~b~0_431) (= v_main_~d~0_787 v_main_~d~0_790) .cse7 .cse8) (and .cse0 .cse1 .cse2 (= v_main_~b~0_431 v_main_~b~0_429) .cse3 .cse4 .cse5 .cse6 (= v_main_~d~0_790 v_main_~d~0_787) .cse7 .cse8 (= |v_main_#t~pre8_3195| |v_main_#t~pre8_3188|)))) InVars {main_~e~0=v_main_~e~0_3951, main_~d~0=v_main_~d~0_790, main_~b~0=v_main_~b~0_431, main_~f~0=v_main_~f~0_10158, main_#t~pre7=|v_main_#t~pre7_535|, main_~c~0=v_main_~c~0_556, main_#t~pre8=|v_main_#t~pre8_3195|, main_#t~pre9=|v_main_#t~pre9_6833|, main_#t~pre4=|v_main_#t~pre4_264|, main_#t~pre5=|v_main_#t~pre5_316|, main_~a~0=v_main_~a~0_322, main_#t~pre6=|v_main_#t~pre6_386|} OutVars{main_~e~0=v_main_~e~0_3942, main_~d~0=v_main_~d~0_787, main_~b~0=v_main_~b~0_429, main_~f~0=v_main_~f~0_10110, main_#t~pre7=|v_main_#t~pre7_533|, main_~c~0=v_main_~c~0_554, main_#t~pre8=|v_main_#t~pre8_3188|, main_#t~pre9=|v_main_#t~pre9_6792|, main_#t~pre4=|v_main_#t~pre4_263|, main_#t~pre5=|v_main_#t~pre5_315|, main_~a~0=v_main_~a~0_321, main_#t~pre6=|v_main_#t~pre6_385|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {36312#(= main_~a~0 0)} is VALID [2022-04-15 07:21:05,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {36312#(= main_~a~0 0)} [199] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {36308#false} is VALID [2022-04-15 07:21:05,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {36308#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {36308#false} is VALID [2022-04-15 07:21:05,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {36308#false} assume !false; {36308#false} is VALID [2022-04-15 07:21:05,280 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:21:05,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:05,280 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818038258] [2022-04-15 07:21:05,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818038258] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:05,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:05,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:21:07,356 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:07,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [800508218] [2022-04-15 07:21:07,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [800508218] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:07,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:07,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 07:21:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607489964] [2022-04-15 07:21:07,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:07,357 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 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 127 [2022-04-15 07:21:07,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:07,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:07,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:07,418 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 07:21:07,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:07,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 07:21:07,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=3094, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 07:21:07,419 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,595 INFO L93 Difference]: Finished difference Result 175 states and 199 transitions. [2022-04-15 07:21:14,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 07:21:14,596 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 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 127 [2022-04-15 07:21:14,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:14,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 199 transitions. [2022-04-15 07:21:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 199 transitions. [2022-04-15 07:21:14,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 199 transitions. [2022-04-15 07:21:14,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:14,698 INFO L225 Difference]: With dead ends: 175 [2022-04-15 07:21:14,698 INFO L226 Difference]: Without dead ends: 160 [2022-04-15 07:21:14,699 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 38 SyntacticMatches, 33 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2970 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=978, Invalid=12132, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 07:21:14,699 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 318 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 5614 mSolverCounterSat, 231 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 5845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Valid, 5614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:14,699 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [318 Valid, 24 Invalid, 5845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [231 Valid, 5614 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-04-15 07:21:14,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-04-15 07:21:14,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 132. [2022-04-15 07:21:14,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:14,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,809 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,809 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,810 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2022-04-15 07:21:14,810 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2022-04-15 07:21:14,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:14,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:14,810 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 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 160 states. [2022-04-15 07:21:14,811 INFO L87 Difference]: Start difference. First operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 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 160 states. [2022-04-15 07:21:14,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:14,812 INFO L93 Difference]: Finished difference Result 160 states and 177 transitions. [2022-04-15 07:21:14,812 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 177 transitions. [2022-04-15 07:21:14,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:14,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:14,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:14,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:14,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 128 states have (on average 1.046875) internal successors, (134), 128 states have internal predecessors, (134), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2022-04-15 07:21:14,813 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 127 [2022-04-15 07:21:14,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:14,813 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2022-04-15 07:21:14,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.1016949152542375) internal successors, (124), 58 states have internal predecessors, (124), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:14,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 137 transitions. [2022-04-15 07:21:15,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:15,303 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-04-15 07:21:15,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 07:21:15,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:15,304 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:15,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2022-04-15 07:21:15,304 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:15,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:15,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1945301269, now seen corresponding path program 49 times [2022-04-15 07:21:15,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:15,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1517362034] [2022-04-15 07:21:15,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:15,901 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:15,901 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:15,901 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:15,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:15,902 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:15,902 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:15,902 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:16,176 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:21:16,176 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:21:16,177 INFO L85 PathProgramCache]: Analyzing trace with hash 1834860267, now seen corresponding path program 1 times [2022-04-15 07:21:16,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:16,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796101652] [2022-04-15 07:21:16,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:16,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:16,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:16,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:16,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:16,215 INFO L290 TraceCheckUtils]: 0: Hoare triple {37423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {37417#true} is VALID [2022-04-15 07:21:16,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {37417#true} assume true; {37417#true} is VALID [2022-04-15 07:21:16,215 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37417#true} {37417#true} #92#return; {37417#true} is VALID [2022-04-15 07:21:16,216 INFO L272 TraceCheckUtils]: 0: Hoare triple {37417#true} call ULTIMATE.init(); {37423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:16,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {37423#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {37417#true} is VALID [2022-04-15 07:21:16,216 INFO L290 TraceCheckUtils]: 2: Hoare triple {37417#true} assume true; {37417#true} is VALID [2022-04-15 07:21:16,216 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37417#true} {37417#true} #92#return; {37417#true} is VALID [2022-04-15 07:21:16,216 INFO L272 TraceCheckUtils]: 4: Hoare triple {37417#true} call #t~ret10 := main(); {37417#true} is VALID [2022-04-15 07:21:16,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {37417#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {37422#(= main_~a~0 0)} is VALID [2022-04-15 07:21:16,217 INFO L290 TraceCheckUtils]: 6: Hoare triple {37422#(= main_~a~0 0)} [202] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_322| |v_main_#t~pre5_321|)) (.cse1 (= |v_main_#t~pre7_550| |v_main_#t~pre7_548|)) (.cse2 (= v_main_~f~0_10426 v_main_~f~0_10377)) (.cse3 (= v_main_~a~0_328 v_main_~a~0_327)) (.cse4 (= |v_main_#t~pre4_269| |v_main_#t~pre4_268|)) (.cse5 (= v_main_~c~0_566 v_main_~c~0_564)) (.cse6 (= |v_main_#t~pre6_393| |v_main_#t~pre6_392|)) (.cse7 (= v_main_~b~0_439 v_main_~b~0_437))) (or (and .cse0 .cse1 (= |v_main_#t~pre8_3225| |v_main_#t~pre8_3232|) .cse2 .cse3 (= v_main_~d~0_811 v_main_~d~0_814) .cse4 .cse5 .cse6 (= v_main_~e~0_4003 v_main_~e~0_4012) (= |v_main_#t~pre9_6973| |v_main_#t~pre9_7015|) .cse7) (and .cse0 (= |v_main_#t~pre8_3232| |v_main_#t~pre8_3225|) .cse1 (= v_main_~d~0_814 v_main_~d~0_811) (= |v_main_#t~pre9_7015| |v_main_#t~pre9_6973|) .cse2 .cse3 (= v_main_~e~0_4012 v_main_~e~0_4003) .cse4 .cse5 .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_4012, main_~d~0=v_main_~d~0_814, main_~b~0=v_main_~b~0_439, main_~f~0=v_main_~f~0_10426, main_#t~pre7=|v_main_#t~pre7_550|, main_~c~0=v_main_~c~0_566, main_#t~pre8=|v_main_#t~pre8_3232|, main_#t~pre9=|v_main_#t~pre9_7015|, main_#t~pre4=|v_main_#t~pre4_269|, main_#t~pre5=|v_main_#t~pre5_322|, main_~a~0=v_main_~a~0_328, main_#t~pre6=|v_main_#t~pre6_393|} OutVars{main_~e~0=v_main_~e~0_4003, main_~d~0=v_main_~d~0_811, main_~b~0=v_main_~b~0_437, main_~f~0=v_main_~f~0_10377, main_#t~pre7=|v_main_#t~pre7_548|, main_~c~0=v_main_~c~0_564, main_#t~pre8=|v_main_#t~pre8_3225|, main_#t~pre9=|v_main_#t~pre9_6973|, main_#t~pre4=|v_main_#t~pre4_268|, main_#t~pre5=|v_main_#t~pre5_321|, main_~a~0=v_main_~a~0_327, main_#t~pre6=|v_main_#t~pre6_392|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {37422#(= main_~a~0 0)} is VALID [2022-04-15 07:21:16,217 INFO L290 TraceCheckUtils]: 7: Hoare triple {37422#(= main_~a~0 0)} [201] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {37418#false} is VALID [2022-04-15 07:21:16,217 INFO L290 TraceCheckUtils]: 8: Hoare triple {37418#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {37418#false} is VALID [2022-04-15 07:21:16,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {37418#false} assume !false; {37418#false} is VALID [2022-04-15 07:21:16,217 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:21:16,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:16,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796101652] [2022-04-15 07:21:16,218 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796101652] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:16,218 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:16,218 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:21:18,571 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:18,571 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1517362034] [2022-04-15 07:21:18,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1517362034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:18,571 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:18,571 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 07:21:18,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666318541] [2022-04-15 07:21:18,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:18,572 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 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 129 [2022-04-15 07:21:18,572 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:18,572 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:18,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:18,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 07:21:18,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:18,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 07:21:18,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=3207, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 07:21:18,638 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:25,429 INFO L93 Difference]: Finished difference Result 176 states and 199 transitions. [2022-04-15 07:21:25,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 07:21:25,429 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 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 129 [2022-04-15 07:21:25,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:25,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 199 transitions. [2022-04-15 07:21:25,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 199 transitions. [2022-04-15 07:21:25,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 199 transitions. [2022-04-15 07:21:25,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:25,526 INFO L225 Difference]: With dead ends: 176 [2022-04-15 07:21:25,526 INFO L226 Difference]: Without dead ends: 161 [2022-04-15 07:21:25,527 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 50 SyntacticMatches, 22 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3080 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=993, Invalid=12579, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 07:21:25,527 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 261 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 4756 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 4926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 4756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:25,527 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 24 Invalid, 4926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 4756 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:21:25,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-04-15 07:21:25,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 134. [2022-04-15 07:21:25,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:25,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,643 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,643 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:25,644 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2022-04-15 07:21:25,644 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2022-04-15 07:21:25,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:25,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:25,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 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 161 states. [2022-04-15 07:21:25,644 INFO L87 Difference]: Start difference. First operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 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 161 states. [2022-04-15 07:21:25,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:25,646 INFO L93 Difference]: Finished difference Result 161 states and 178 transitions. [2022-04-15 07:21:25,646 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 178 transitions. [2022-04-15 07:21:25,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:25,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:25,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:25,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:25,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 130 states have internal predecessors, (136), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 139 transitions. [2022-04-15 07:21:25,647 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 139 transitions. Word has length 129 [2022-04-15 07:21:25,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:25,647 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 139 transitions. [2022-04-15 07:21:25,647 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.1) internal successors, (126), 59 states have internal predecessors, (126), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:25,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 139 transitions. [2022-04-15 07:21:26,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:26,126 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 139 transitions. [2022-04-15 07:21:26,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2022-04-15 07:21:26,127 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:26,127 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:26,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2022-04-15 07:21:26,127 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:26,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:26,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1356807254, now seen corresponding path program 50 times [2022-04-15 07:21:26,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:26,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [369619634] [2022-04-15 07:21:26,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:26,713 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:26,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:26,713 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:26,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:26,713 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:26,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:26,713 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:26,856 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:21:26,856 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:21:26,856 INFO L85 PathProgramCache]: Analyzing trace with hash 1834921771, now seen corresponding path program 1 times [2022-04-15 07:21:26,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:26,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426952322] [2022-04-15 07:21:26,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:26,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:26,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:26,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:26,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:26,889 INFO L290 TraceCheckUtils]: 0: Hoare triple {38544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {38538#true} is VALID [2022-04-15 07:21:26,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {38538#true} assume true; {38538#true} is VALID [2022-04-15 07:21:26,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38538#true} {38538#true} #92#return; {38538#true} is VALID [2022-04-15 07:21:26,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {38538#true} call ULTIMATE.init(); {38544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:26,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {38544#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {38538#true} is VALID [2022-04-15 07:21:26,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {38538#true} assume true; {38538#true} is VALID [2022-04-15 07:21:26,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38538#true} {38538#true} #92#return; {38538#true} is VALID [2022-04-15 07:21:26,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {38538#true} call #t~ret10 := main(); {38538#true} is VALID [2022-04-15 07:21:26,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {38538#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {38543#(= main_~a~0 0)} is VALID [2022-04-15 07:21:26,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {38543#(= main_~a~0 0)} [204] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_328| |v_main_#t~pre5_327|)) (.cse1 (= |v_main_#t~pre4_274| |v_main_#t~pre4_273|)) (.cse2 (= |v_main_#t~pre9_7197| |v_main_#t~pre9_7155|)) (.cse3 (= |v_main_#t~pre6_400| |v_main_#t~pre6_399|)) (.cse4 (= |v_main_#t~pre7_565| |v_main_#t~pre7_563|)) (.cse5 (= v_main_~c~0_576 v_main_~c~0_574)) (.cse6 (= v_main_~b~0_447 v_main_~b~0_445)) (.cse7 (= v_main_~f~0_10700 v_main_~f~0_10650)) (.cse8 (= v_main_~d~0_838 v_main_~d~0_835)) (.cse9 (= v_main_~a~0_334 v_main_~a~0_333))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~e~0_4080 v_main_~e~0_4070) .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 (= |v_main_#t~pre8_3274| |v_main_#t~pre8_3266|)) (and .cse0 .cse1 .cse2 (= v_main_~e~0_4070 v_main_~e~0_4080) .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre8_3266| |v_main_#t~pre8_3274|) .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_4080, main_~d~0=v_main_~d~0_838, main_~b~0=v_main_~b~0_447, main_~f~0=v_main_~f~0_10700, main_#t~pre7=|v_main_#t~pre7_565|, main_~c~0=v_main_~c~0_576, main_#t~pre8=|v_main_#t~pre8_3274|, main_#t~pre9=|v_main_#t~pre9_7197|, main_#t~pre4=|v_main_#t~pre4_274|, main_#t~pre5=|v_main_#t~pre5_328|, main_~a~0=v_main_~a~0_334, main_#t~pre6=|v_main_#t~pre6_400|} OutVars{main_~e~0=v_main_~e~0_4070, main_~d~0=v_main_~d~0_835, main_~b~0=v_main_~b~0_445, main_~f~0=v_main_~f~0_10650, main_#t~pre7=|v_main_#t~pre7_563|, main_~c~0=v_main_~c~0_574, main_#t~pre8=|v_main_#t~pre8_3266|, main_#t~pre9=|v_main_#t~pre9_7155|, main_#t~pre4=|v_main_#t~pre4_273|, main_#t~pre5=|v_main_#t~pre5_327|, main_~a~0=v_main_~a~0_333, main_#t~pre6=|v_main_#t~pre6_399|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {38543#(= main_~a~0 0)} is VALID [2022-04-15 07:21:26,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {38543#(= main_~a~0 0)} [203] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {38539#false} is VALID [2022-04-15 07:21:26,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {38539#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {38539#false} is VALID [2022-04-15 07:21:26,891 INFO L290 TraceCheckUtils]: 9: Hoare triple {38539#false} assume !false; {38539#false} is VALID [2022-04-15 07:21:26,891 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:21:26,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:26,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426952322] [2022-04-15 07:21:26,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426952322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:26,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:26,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:21:28,558 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:28,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [369619634] [2022-04-15 07:21:28,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [369619634] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:28,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:28,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 07:21:28,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523794271] [2022-04-15 07:21:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:28,559 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 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 132 [2022-04-15 07:21:28,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:28,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:28,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:28,617 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 07:21:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:28,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 07:21:28,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3322, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 07:21:28,618 INFO L87 Difference]: Start difference. First operand 134 states and 139 transitions. Second operand has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:35,178 INFO L93 Difference]: Finished difference Result 178 states and 201 transitions. [2022-04-15 07:21:35,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 07:21:35,178 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 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 132 [2022-04-15 07:21:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:35,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 201 transitions. [2022-04-15 07:21:35,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 201 transitions. [2022-04-15 07:21:35,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 201 transitions. [2022-04-15 07:21:35,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:35,277 INFO L225 Difference]: With dead ends: 178 [2022-04-15 07:21:35,277 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 07:21:35,277 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 48 SyntacticMatches, 26 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3215 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1008, Invalid=13034, Unknown=0, NotChecked=0, Total=14042 [2022-04-15 07:21:35,278 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 335 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 5509 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 5746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 5509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:35,278 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [335 Valid, 19 Invalid, 5746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 5509 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-04-15 07:21:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 07:21:35,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 135. [2022-04-15 07:21:35,391 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:35,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,391 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,391 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:35,392 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2022-04-15 07:21:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2022-04-15 07:21:35,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:35,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:35,393 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 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 163 states. [2022-04-15 07:21:35,393 INFO L87 Difference]: Start difference. First operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 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 163 states. [2022-04-15 07:21:35,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:35,398 INFO L93 Difference]: Finished difference Result 163 states and 180 transitions. [2022-04-15 07:21:35,398 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 180 transitions. [2022-04-15 07:21:35,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:35,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:35,398 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:35,398 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:35,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 131 states have (on average 1.0458015267175573) internal successors, (137), 131 states have internal predecessors, (137), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 140 transitions. [2022-04-15 07:21:35,399 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 140 transitions. Word has length 132 [2022-04-15 07:21:35,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:35,400 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 140 transitions. [2022-04-15 07:21:35,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.1147540983606556) internal successors, (129), 60 states have internal predecessors, (129), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:35,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 140 transitions. [2022-04-15 07:21:35,888 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:35,889 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 140 transitions. [2022-04-15 07:21:35,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 07:21:35,889 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:35,889 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:35,889 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55 [2022-04-15 07:21:35,889 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:35,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:35,889 INFO L85 PathProgramCache]: Analyzing trace with hash 1694096648, now seen corresponding path program 51 times [2022-04-15 07:21:35,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:35,890 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1289212471] [2022-04-15 07:21:36,537 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:36,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:36,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:36,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:36,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:36,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:36,538 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:36,538 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:36,686 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:21:36,687 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:21:36,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1834983275, now seen corresponding path program 1 times [2022-04-15 07:21:36,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:36,687 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833500629] [2022-04-15 07:21:36,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:36,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:36,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:36,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:36,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {39678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {39672#true} is VALID [2022-04-15 07:21:36,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {39672#true} assume true; {39672#true} is VALID [2022-04-15 07:21:36,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39672#true} {39672#true} #92#return; {39672#true} is VALID [2022-04-15 07:21:36,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {39672#true} call ULTIMATE.init(); {39678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:36,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {39678#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {39672#true} is VALID [2022-04-15 07:21:36,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {39672#true} assume true; {39672#true} is VALID [2022-04-15 07:21:36,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39672#true} {39672#true} #92#return; {39672#true} is VALID [2022-04-15 07:21:36,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {39672#true} call #t~ret10 := main(); {39672#true} is VALID [2022-04-15 07:21:36,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {39672#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {39677#(= main_~a~0 0)} is VALID [2022-04-15 07:21:36,715 INFO L290 TraceCheckUtils]: 6: Hoare triple {39677#(= main_~a~0 0)} [206] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_7384| |v_main_#t~pre9_7341|)) (.cse1 (= |v_main_#t~pre5_334| |v_main_#t~pre5_333|)) (.cse2 (= v_main_~b~0_455 v_main_~b~0_453)) (.cse3 (= v_main_~c~0_586 v_main_~c~0_584)) (.cse4 (= v_main_~a~0_340 v_main_~a~0_339)) (.cse5 (= |v_main_#t~pre4_279| |v_main_#t~pre4_278|)) (.cse6 (= v_main_~d~0_862 v_main_~d~0_859)) (.cse7 (= v_main_~e~0_4148 v_main_~e~0_4138)) (.cse8 (= |v_main_#t~pre6_407| |v_main_#t~pre6_406|)) (.cse9 (= v_main_~f~0_10980 v_main_~f~0_10929))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre7_580| |v_main_#t~pre7_578|) .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre8_3316| |v_main_#t~pre8_3308|) .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre8_3308| |v_main_#t~pre8_3316|) .cse3 .cse4 .cse5 (= |v_main_#t~pre7_578| |v_main_#t~pre7_580|) .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_4148, main_~d~0=v_main_~d~0_862, main_~b~0=v_main_~b~0_455, main_~f~0=v_main_~f~0_10980, main_#t~pre7=|v_main_#t~pre7_580|, main_~c~0=v_main_~c~0_586, main_#t~pre8=|v_main_#t~pre8_3316|, main_#t~pre9=|v_main_#t~pre9_7384|, main_#t~pre4=|v_main_#t~pre4_279|, main_#t~pre5=|v_main_#t~pre5_334|, main_~a~0=v_main_~a~0_340, main_#t~pre6=|v_main_#t~pre6_407|} OutVars{main_~e~0=v_main_~e~0_4138, main_~d~0=v_main_~d~0_859, main_~b~0=v_main_~b~0_453, main_~f~0=v_main_~f~0_10929, main_#t~pre7=|v_main_#t~pre7_578|, main_~c~0=v_main_~c~0_584, main_#t~pre8=|v_main_#t~pre8_3308|, main_#t~pre9=|v_main_#t~pre9_7341|, main_#t~pre4=|v_main_#t~pre4_278|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_339, main_#t~pre6=|v_main_#t~pre6_406|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {39677#(= main_~a~0 0)} is VALID [2022-04-15 07:21:36,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {39677#(= main_~a~0 0)} [205] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {39673#false} is VALID [2022-04-15 07:21:36,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {39673#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {39673#false} is VALID [2022-04-15 07:21:36,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {39673#false} assume !false; {39673#false} is VALID [2022-04-15 07:21:36,715 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:21:36,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:36,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833500629] [2022-04-15 07:21:36,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833500629] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:36,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:36,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:21:38,967 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:38,967 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1289212471] [2022-04-15 07:21:38,967 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1289212471] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:38,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:38,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 07:21:38,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797438521] [2022-04-15 07:21:38,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:38,967 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 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 134 [2022-04-15 07:21:38,968 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:38,968 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:39,027 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:39,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 07:21:39,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:39,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 07:21:39,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=3439, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 07:21:39,028 INFO L87 Difference]: Start difference. First operand 135 states and 140 transitions. Second operand has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:46,090 INFO L93 Difference]: Finished difference Result 180 states and 203 transitions. [2022-04-15 07:21:46,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 07:21:46,090 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 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 134 [2022-04-15 07:21:46,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:46,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 203 transitions. [2022-04-15 07:21:46,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 203 transitions. [2022-04-15 07:21:46,098 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 203 transitions. [2022-04-15 07:21:46,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:46,195 INFO L225 Difference]: With dead ends: 180 [2022-04-15 07:21:46,195 INFO L226 Difference]: Without dead ends: 165 [2022-04-15 07:21:46,196 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 47 SyntacticMatches, 28 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3411 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1023, Invalid=13497, Unknown=0, NotChecked=0, Total=14520 [2022-04-15 07:21:46,196 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 261 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 5383 mSolverCounterSat, 179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 261 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 5562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 179 IncrementalHoareTripleChecker+Valid, 5383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:46,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [261 Valid, 29 Invalid, 5562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [179 Valid, 5383 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-04-15 07:21:46,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-04-15 07:21:46,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 137. [2022-04-15 07:21:46,313 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:46,314 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,314 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,314 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:46,315 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2022-04-15 07:21:46,315 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2022-04-15 07:21:46,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:46,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:46,316 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 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 165 states. [2022-04-15 07:21:46,316 INFO L87 Difference]: Start difference. First operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 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 165 states. [2022-04-15 07:21:46,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:46,317 INFO L93 Difference]: Finished difference Result 165 states and 182 transitions. [2022-04-15 07:21:46,317 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2022-04-15 07:21:46,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:46,317 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:46,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:46,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:46,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 133 states have internal predecessors, (139), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 142 transitions. [2022-04-15 07:21:46,319 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 142 transitions. Word has length 134 [2022-04-15 07:21:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:46,319 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 142 transitions. [2022-04-15 07:21:46,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.1129032258064515) internal successors, (131), 61 states have internal predecessors, (131), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:46,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 142 transitions. [2022-04-15 07:21:46,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 142 transitions. [2022-04-15 07:21:46,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-04-15 07:21:46,850 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:46,850 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:46,850 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56 [2022-04-15 07:21:46,850 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:46,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:46,851 INFO L85 PathProgramCache]: Analyzing trace with hash 150083302, now seen corresponding path program 52 times [2022-04-15 07:21:46,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:46,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1815151631] [2022-04-15 07:21:47,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:21:47,429 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:47,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:47,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:47,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:47,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:47,430 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:21:47,430 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:21:47,570 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:21:47,570 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:21:47,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1835044779, now seen corresponding path program 1 times [2022-04-15 07:21:47,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:21:47,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165793072] [2022-04-15 07:21:47,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:21:47,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:21:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:47,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:21:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:21:47,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {40827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {40821#true} is VALID [2022-04-15 07:21:47,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {40821#true} assume true; {40821#true} is VALID [2022-04-15 07:21:47,618 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40821#true} {40821#true} #92#return; {40821#true} is VALID [2022-04-15 07:21:47,619 INFO L272 TraceCheckUtils]: 0: Hoare triple {40821#true} call ULTIMATE.init(); {40827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:21:47,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {40827#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {40821#true} is VALID [2022-04-15 07:21:47,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {40821#true} assume true; {40821#true} is VALID [2022-04-15 07:21:47,619 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40821#true} {40821#true} #92#return; {40821#true} is VALID [2022-04-15 07:21:47,619 INFO L272 TraceCheckUtils]: 4: Hoare triple {40821#true} call #t~ret10 := main(); {40821#true} is VALID [2022-04-15 07:21:47,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {40821#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {40826#(= main_~a~0 0)} is VALID [2022-04-15 07:21:47,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {40826#(= main_~a~0 0)} [208] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_346 v_main_~a~0_345)) (.cse1 (= v_main_~f~0_11266 v_main_~f~0_11214)) (.cse2 (= |v_main_#t~pre7_595| |v_main_#t~pre7_593|)) (.cse3 (= |v_main_#t~pre6_414| |v_main_#t~pre6_413|)) (.cse4 (= v_main_~b~0_463 v_main_~b~0_461)) (.cse5 (= v_main_~c~0_596 v_main_~c~0_594)) (.cse6 (= |v_main_#t~pre8_3358| |v_main_#t~pre8_3350|)) (.cse7 (= |v_main_#t~pre9_7576| |v_main_#t~pre9_7532|)) (.cse8 (= v_main_~d~0_886 v_main_~d~0_883))) (or (and (= v_main_~e~0_4216 v_main_~e~0_4206) .cse0 .cse1 (= |v_main_#t~pre4_284| |v_main_#t~pre4_283|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre5_340| |v_main_#t~pre5_339|)) (and (= v_main_~e~0_4206 v_main_~e~0_4216) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= |v_main_#t~pre4_283| |v_main_#t~pre4_284|) .cse7 (= |v_main_#t~pre5_339| |v_main_#t~pre5_340|) .cse8))) InVars {main_~e~0=v_main_~e~0_4216, main_~d~0=v_main_~d~0_886, main_~b~0=v_main_~b~0_463, main_~f~0=v_main_~f~0_11266, main_#t~pre7=|v_main_#t~pre7_595|, main_~c~0=v_main_~c~0_596, main_#t~pre8=|v_main_#t~pre8_3358|, main_#t~pre9=|v_main_#t~pre9_7576|, main_#t~pre4=|v_main_#t~pre4_284|, main_#t~pre5=|v_main_#t~pre5_340|, main_~a~0=v_main_~a~0_346, main_#t~pre6=|v_main_#t~pre6_414|} OutVars{main_~e~0=v_main_~e~0_4206, main_~d~0=v_main_~d~0_883, main_~b~0=v_main_~b~0_461, main_~f~0=v_main_~f~0_11214, main_#t~pre7=|v_main_#t~pre7_593|, main_~c~0=v_main_~c~0_594, main_#t~pre8=|v_main_#t~pre8_3350|, main_#t~pre9=|v_main_#t~pre9_7532|, main_#t~pre4=|v_main_#t~pre4_283|, main_#t~pre5=|v_main_#t~pre5_339|, main_~a~0=v_main_~a~0_345, main_#t~pre6=|v_main_#t~pre6_413|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {40826#(= main_~a~0 0)} is VALID [2022-04-15 07:21:47,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {40826#(= main_~a~0 0)} [207] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {40822#false} is VALID [2022-04-15 07:21:47,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {40822#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {40822#false} is VALID [2022-04-15 07:21:47,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {40822#false} assume !false; {40822#false} is VALID [2022-04-15 07:21:47,620 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:21:47,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:21:47,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165793072] [2022-04-15 07:21:47,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165793072] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:47,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:47,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:21:50,063 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:21:50,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1815151631] [2022-04-15 07:21:50,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1815151631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:21:50,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:21:50,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 07:21:50,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051893313] [2022-04-15 07:21:50,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:21:50,064 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 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 136 [2022-04-15 07:21:50,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:21:50,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:50,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:50,157 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 07:21:50,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 07:21:50,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=348, Invalid=3558, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 07:21:50,158 INFO L87 Difference]: Start difference. First operand 137 states and 142 transitions. Second operand has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:58,510 INFO L93 Difference]: Finished difference Result 182 states and 205 transitions. [2022-04-15 07:21:58,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 07:21:58,510 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 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 136 [2022-04-15 07:21:58,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:21:58,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 205 transitions. [2022-04-15 07:21:58,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 205 transitions. [2022-04-15 07:21:58,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 205 transitions. [2022-04-15 07:21:58,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:58,614 INFO L225 Difference]: With dead ends: 182 [2022-04-15 07:21:58,614 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 07:21:58,616 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 49 SyntacticMatches, 27 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3513 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1038, Invalid=13968, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 07:21:58,616 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 236 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 5624 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 5772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 5624 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:21:58,616 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 79 Invalid, 5772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 5624 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 07:21:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 07:21:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 139. [2022-04-15 07:21:58,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:21:58,744 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,744 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,744 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:58,746 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2022-04-15 07:21:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2022-04-15 07:21:58,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:58,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:58,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 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 167 states. [2022-04-15 07:21:58,746 INFO L87 Difference]: Start difference. First operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 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 167 states. [2022-04-15 07:21:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:21:58,748 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2022-04-15 07:21:58,748 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 184 transitions. [2022-04-15 07:21:58,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:21:58,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:21:58,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:21:58,748 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:21:58,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 135 states have (on average 1.0444444444444445) internal successors, (141), 135 states have internal predecessors, (141), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 144 transitions. [2022-04-15 07:21:58,749 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 144 transitions. Word has length 136 [2022-04-15 07:21:58,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:21:58,749 INFO L478 AbstractCegarLoop]: Abstraction has 139 states and 144 transitions. [2022-04-15 07:21:58,749 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.111111111111111) internal successors, (133), 62 states have internal predecessors, (133), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:21:58,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 139 states and 144 transitions. [2022-04-15 07:21:59,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:21:59,337 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 144 transitions. [2022-04-15 07:21:59,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-04-15 07:21:59,338 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:21:59,338 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:21:59,338 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57 [2022-04-15 07:21:59,338 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:21:59,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:21:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash -1883025084, now seen corresponding path program 53 times [2022-04-15 07:21:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:21:59,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [143358209] [2022-04-15 07:22:00,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:00,283 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:00,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:00,283 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:00,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:00,283 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:00,283 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:00,284 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:00,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:22:00,530 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:22:00,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1835106283, now seen corresponding path program 1 times [2022-04-15 07:22:00,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252029018] [2022-04-15 07:22:00,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:00,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:00,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:00,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:22:00,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:00,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {41991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {41985#true} is VALID [2022-04-15 07:22:00,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {41985#true} assume true; {41985#true} is VALID [2022-04-15 07:22:00,552 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41985#true} {41985#true} #92#return; {41985#true} is VALID [2022-04-15 07:22:00,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {41985#true} call ULTIMATE.init(); {41991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:22:00,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {41991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {41985#true} is VALID [2022-04-15 07:22:00,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {41985#true} assume true; {41985#true} is VALID [2022-04-15 07:22:00,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41985#true} {41985#true} #92#return; {41985#true} is VALID [2022-04-15 07:22:00,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {41985#true} call #t~ret10 := main(); {41985#true} is VALID [2022-04-15 07:22:00,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {41985#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {41990#(= main_~a~0 0)} is VALID [2022-04-15 07:22:00,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {41990#(= main_~a~0 0)} [210] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre9_7773| |v_main_#t~pre9_7728|)) (.cse1 (= v_main_~f~0_11558 v_main_~f~0_11505)) (.cse2 (= |v_main_#t~pre8_3400| |v_main_#t~pre8_3392|)) (.cse3 (= |v_main_#t~pre6_421| |v_main_#t~pre6_420|)) (.cse4 (= v_main_~e~0_4284 v_main_~e~0_4274)) (.cse5 (= |v_main_#t~pre4_289| |v_main_#t~pre4_288|)) (.cse6 (= |v_main_#t~pre5_346| |v_main_#t~pre5_345|)) (.cse7 (= v_main_~a~0_352 v_main_~a~0_351))) (or (and .cse0 (= v_main_~b~0_469 v_main_~b~0_471) .cse1 .cse2 .cse3 (= |v_main_#t~pre7_608| |v_main_#t~pre7_610|) .cse4 .cse5 .cse6 .cse7 (= v_main_~d~0_907 v_main_~d~0_910) (= v_main_~c~0_604 v_main_~c~0_606)) (and (= v_main_~b~0_471 v_main_~b~0_469) .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= v_main_~d~0_910 v_main_~d~0_907) (= v_main_~c~0_606 v_main_~c~0_604) (= |v_main_#t~pre7_610| |v_main_#t~pre7_608|) .cse6 .cse7))) InVars {main_~e~0=v_main_~e~0_4284, main_~d~0=v_main_~d~0_910, main_~b~0=v_main_~b~0_471, main_~f~0=v_main_~f~0_11558, main_#t~pre7=|v_main_#t~pre7_610|, main_~c~0=v_main_~c~0_606, main_#t~pre8=|v_main_#t~pre8_3400|, main_#t~pre9=|v_main_#t~pre9_7773|, main_#t~pre4=|v_main_#t~pre4_289|, main_#t~pre5=|v_main_#t~pre5_346|, main_~a~0=v_main_~a~0_352, main_#t~pre6=|v_main_#t~pre6_421|} OutVars{main_~e~0=v_main_~e~0_4274, main_~d~0=v_main_~d~0_907, main_~b~0=v_main_~b~0_469, main_~f~0=v_main_~f~0_11505, main_#t~pre7=|v_main_#t~pre7_608|, main_~c~0=v_main_~c~0_604, main_#t~pre8=|v_main_#t~pre8_3392|, main_#t~pre9=|v_main_#t~pre9_7728|, main_#t~pre4=|v_main_#t~pre4_288|, main_#t~pre5=|v_main_#t~pre5_345|, main_~a~0=v_main_~a~0_351, main_#t~pre6=|v_main_#t~pre6_420|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {41990#(= main_~a~0 0)} is VALID [2022-04-15 07:22:00,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {41990#(= main_~a~0 0)} [209] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {41986#false} is VALID [2022-04-15 07:22:00,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {41986#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {41986#false} is VALID [2022-04-15 07:22:00,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {41986#false} assume !false; {41986#false} is VALID [2022-04-15 07:22:00,554 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:22:00,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:00,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252029018] [2022-04-15 07:22:00,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252029018] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:00,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:00,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:22:03,096 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:03,096 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [143358209] [2022-04-15 07:22:03,096 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [143358209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:03,096 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:03,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 07:22:03,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089932197] [2022-04-15 07:22:03,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:03,096 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 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 138 [2022-04-15 07:22:03,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:03,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:03,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:03,192 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 07:22:03,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:03,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 07:22:03,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=3679, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 07:22:03,192 INFO L87 Difference]: Start difference. First operand 139 states and 144 transitions. Second operand has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:12,433 INFO L93 Difference]: Finished difference Result 184 states and 207 transitions. [2022-04-15 07:22:12,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 07:22:12,433 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 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 138 [2022-04-15 07:22:12,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 207 transitions. [2022-04-15 07:22:12,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 207 transitions. [2022-04-15 07:22:12,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 207 transitions. [2022-04-15 07:22:12,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 207 edges. 207 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:12,594 INFO L225 Difference]: With dead ends: 184 [2022-04-15 07:22:12,594 INFO L226 Difference]: Without dead ends: 169 [2022-04-15 07:22:12,595 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 52 SyntacticMatches, 25 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3764 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1053, Invalid=14447, Unknown=0, NotChecked=0, Total=15500 [2022-04-15 07:22:12,596 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 315 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 6644 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 6877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 6644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:12,596 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [315 Valid, 64 Invalid, 6877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 6644 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-04-15 07:22:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-04-15 07:22:12,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 141. [2022-04-15 07:22:12,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:12,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,727 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,728 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:12,729 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2022-04-15 07:22:12,729 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2022-04-15 07:22:12,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:12,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:12,729 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 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 169 states. [2022-04-15 07:22:12,729 INFO L87 Difference]: Start difference. First operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 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 169 states. [2022-04-15 07:22:12,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:12,731 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2022-04-15 07:22:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 186 transitions. [2022-04-15 07:22:12,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:12,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:12,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:12,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:12,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 137 states have (on average 1.0437956204379562) internal successors, (143), 137 states have internal predecessors, (143), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 146 transitions. [2022-04-15 07:22:12,732 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 146 transitions. Word has length 138 [2022-04-15 07:22:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:12,732 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 146 transitions. [2022-04-15 07:22:12,732 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.109375) internal successors, (135), 63 states have internal predecessors, (135), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:12,732 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 146 transitions. [2022-04-15 07:22:13,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 146 transitions. [2022-04-15 07:22:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-15 07:22:13,325 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:13,325 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:13,325 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable58 [2022-04-15 07:22:13,325 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:13,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1490064350, now seen corresponding path program 54 times [2022-04-15 07:22:13,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:13,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [373563350] [2022-04-15 07:22:14,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:14,281 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:14,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:14,281 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:14,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:14,281 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:14,281 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:14,282 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:14,520 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:22:14,521 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:22:14,521 INFO L85 PathProgramCache]: Analyzing trace with hash 1835167787, now seen corresponding path program 1 times [2022-04-15 07:22:14,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:14,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750183886] [2022-04-15 07:22:14,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:14,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:14,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:22:14,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:14,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {43170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {43164#true} is VALID [2022-04-15 07:22:14,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {43164#true} assume true; {43164#true} is VALID [2022-04-15 07:22:14,542 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43164#true} {43164#true} #92#return; {43164#true} is VALID [2022-04-15 07:22:14,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {43164#true} call ULTIMATE.init(); {43170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:22:14,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {43170#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {43164#true} is VALID [2022-04-15 07:22:14,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {43164#true} assume true; {43164#true} is VALID [2022-04-15 07:22:14,543 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43164#true} {43164#true} #92#return; {43164#true} is VALID [2022-04-15 07:22:14,543 INFO L272 TraceCheckUtils]: 4: Hoare triple {43164#true} call #t~ret10 := main(); {43164#true} is VALID [2022-04-15 07:22:14,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {43164#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {43169#(= main_~a~0 0)} is VALID [2022-04-15 07:22:14,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {43169#(= main_~a~0 0)} [212] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_479 v_main_~b~0_477)) (.cse1 (= |v_main_#t~pre8_3442| |v_main_#t~pre8_3434|)) (.cse2 (= v_main_~f~0_11856 v_main_~f~0_11802)) (.cse3 (= |v_main_#t~pre7_625| |v_main_#t~pre7_623|)) (.cse4 (= |v_main_#t~pre9_7975| |v_main_#t~pre9_7929|)) (.cse5 (= |v_main_#t~pre6_428| |v_main_#t~pre6_427|)) (.cse6 (= |v_main_#t~pre4_294| |v_main_#t~pre4_293|)) (.cse7 (= v_main_~a~0_358 v_main_~a~0_357)) (.cse8 (= |v_main_#t~pre5_352| |v_main_#t~pre5_351|))) (or (and .cse0 .cse1 (= v_main_~c~0_614 v_main_~c~0_616) .cse2 .cse3 (= v_main_~d~0_931 v_main_~d~0_934) .cse4 .cse5 (= v_main_~e~0_4342 v_main_~e~0_4352) .cse6 .cse7 .cse8) (and (= v_main_~e~0_4352 v_main_~e~0_4342) .cse0 .cse1 (= v_main_~c~0_616 v_main_~c~0_614) (= v_main_~d~0_934 v_main_~d~0_931) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_4352, main_~d~0=v_main_~d~0_934, main_~b~0=v_main_~b~0_479, main_~f~0=v_main_~f~0_11856, main_#t~pre7=|v_main_#t~pre7_625|, main_~c~0=v_main_~c~0_616, main_#t~pre8=|v_main_#t~pre8_3442|, main_#t~pre9=|v_main_#t~pre9_7975|, main_#t~pre4=|v_main_#t~pre4_294|, main_#t~pre5=|v_main_#t~pre5_352|, main_~a~0=v_main_~a~0_358, main_#t~pre6=|v_main_#t~pre6_428|} OutVars{main_~e~0=v_main_~e~0_4342, main_~d~0=v_main_~d~0_931, main_~b~0=v_main_~b~0_477, main_~f~0=v_main_~f~0_11802, main_#t~pre7=|v_main_#t~pre7_623|, main_~c~0=v_main_~c~0_614, main_#t~pre8=|v_main_#t~pre8_3434|, main_#t~pre9=|v_main_#t~pre9_7929|, main_#t~pre4=|v_main_#t~pre4_293|, main_#t~pre5=|v_main_#t~pre5_351|, main_~a~0=v_main_~a~0_357, main_#t~pre6=|v_main_#t~pre6_427|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {43169#(= main_~a~0 0)} is VALID [2022-04-15 07:22:14,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {43169#(= main_~a~0 0)} [211] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {43165#false} is VALID [2022-04-15 07:22:14,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {43165#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {43165#false} is VALID [2022-04-15 07:22:14,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {43165#false} assume !false; {43165#false} is VALID [2022-04-15 07:22:14,545 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:22:14,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:14,545 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750183886] [2022-04-15 07:22:14,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750183886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:14,545 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:14,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:22:16,668 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:16,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [373563350] [2022-04-15 07:22:16,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [373563350] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:16,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:16,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 07:22:16,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141675838] [2022-04-15 07:22:16,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:16,669 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 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 140 [2022-04-15 07:22:16,669 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:16,669 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:16,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:16,730 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 07:22:16,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:16,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 07:22:16,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=358, Invalid=3802, Unknown=0, NotChecked=0, Total=4160 [2022-04-15 07:22:16,731 INFO L87 Difference]: Start difference. First operand 141 states and 146 transitions. Second operand has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:24,159 INFO L93 Difference]: Finished difference Result 186 states and 209 transitions. [2022-04-15 07:22:24,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 07:22:24,159 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 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 140 [2022-04-15 07:22:24,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 209 transitions. [2022-04-15 07:22:24,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 209 transitions. [2022-04-15 07:22:24,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 209 transitions. [2022-04-15 07:22:24,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:24,265 INFO L225 Difference]: With dead ends: 186 [2022-04-15 07:22:24,265 INFO L226 Difference]: Without dead ends: 171 [2022-04-15 07:22:24,266 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 47 SyntacticMatches, 31 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3829 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=1068, Invalid=14934, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 07:22:24,266 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 277 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5982 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 6153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 5982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:24,267 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [277 Valid, 44 Invalid, 6153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 5982 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-04-15 07:22:24,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-04-15 07:22:24,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 143. [2022-04-15 07:22:24,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:24,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,396 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,396 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:24,397 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-04-15 07:22:24,397 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2022-04-15 07:22:24,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:24,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:24,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 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 171 states. [2022-04-15 07:22:24,398 INFO L87 Difference]: Start difference. First operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 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 171 states. [2022-04-15 07:22:24,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:24,399 INFO L93 Difference]: Finished difference Result 171 states and 188 transitions. [2022-04-15 07:22:24,399 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 188 transitions. [2022-04-15 07:22:24,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:24,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:24,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:24,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:24,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 139 states have (on average 1.0431654676258992) internal successors, (145), 139 states have internal predecessors, (145), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2022-04-15 07:22:24,401 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 140 [2022-04-15 07:22:24,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:24,401 INFO L478 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2022-04-15 07:22:24,401 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.1076923076923078) internal successors, (137), 64 states have internal predecessors, (137), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:24,401 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 143 states and 148 transitions. [2022-04-15 07:22:25,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:25,040 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2022-04-15 07:22:25,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-04-15 07:22:25,040 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:25,040 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:25,041 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59 [2022-04-15 07:22:25,041 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:25,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:25,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1811921024, now seen corresponding path program 55 times [2022-04-15 07:22:25,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:25,041 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1487245843] [2022-04-15 07:22:25,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:25,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:25,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:25,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:25,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:25,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:25,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:25,725 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:25,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:22:25,866 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:22:25,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1835229291, now seen corresponding path program 1 times [2022-04-15 07:22:25,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:25,867 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674868886] [2022-04-15 07:22:25,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:25,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:25,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:25,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:22:25,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:25,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {44364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {44358#true} assume true; {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44358#true} {44358#true} #92#return; {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {44358#true} call ULTIMATE.init(); {44364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:22:25,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {44364#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {44358#true} assume true; {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44358#true} {44358#true} #92#return; {44358#true} is VALID [2022-04-15 07:22:25,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {44358#true} call #t~ret10 := main(); {44358#true} is VALID [2022-04-15 07:22:25,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {44358#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {44363#(= main_~a~0 0)} is VALID [2022-04-15 07:22:25,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {44363#(= main_~a~0 0)} [214] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_487 v_main_~b~0_485)) (.cse1 (= |v_main_#t~pre6_435| |v_main_#t~pre6_434|)) (.cse2 (= v_main_~c~0_626 v_main_~c~0_624)) (.cse3 (= |v_main_#t~pre4_299| |v_main_#t~pre4_298|)) (.cse4 (= |v_main_#t~pre8_3484| |v_main_#t~pre8_3476|)) (.cse5 (= v_main_~a~0_364 v_main_~a~0_363)) (.cse6 (= v_main_~e~0_4420 v_main_~e~0_4410)) (.cse7 (= v_main_~f~0_12160 v_main_~f~0_12105)) (.cse8 (= |v_main_#t~pre9_8182| |v_main_#t~pre9_8135|)) (.cse9 (= |v_main_#t~pre5_358| |v_main_#t~pre5_357|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (= v_main_~d~0_955 v_main_~d~0_958) .cse7 .cse8 (= |v_main_#t~pre7_638| |v_main_#t~pre7_640|) .cse9) (and .cse0 (= v_main_~d~0_958 v_main_~d~0_955) .cse1 .cse2 (= |v_main_#t~pre7_640| |v_main_#t~pre7_638|) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9))) InVars {main_~e~0=v_main_~e~0_4420, main_~d~0=v_main_~d~0_958, main_~b~0=v_main_~b~0_487, main_~f~0=v_main_~f~0_12160, main_#t~pre7=|v_main_#t~pre7_640|, main_~c~0=v_main_~c~0_626, main_#t~pre8=|v_main_#t~pre8_3484|, main_#t~pre9=|v_main_#t~pre9_8182|, main_#t~pre4=|v_main_#t~pre4_299|, main_#t~pre5=|v_main_#t~pre5_358|, main_~a~0=v_main_~a~0_364, main_#t~pre6=|v_main_#t~pre6_435|} OutVars{main_~e~0=v_main_~e~0_4410, main_~d~0=v_main_~d~0_955, main_~b~0=v_main_~b~0_485, main_~f~0=v_main_~f~0_12105, main_#t~pre7=|v_main_#t~pre7_638|, main_~c~0=v_main_~c~0_624, main_#t~pre8=|v_main_#t~pre8_3476|, main_#t~pre9=|v_main_#t~pre9_8135|, main_#t~pre4=|v_main_#t~pre4_298|, main_#t~pre5=|v_main_#t~pre5_357|, main_~a~0=v_main_~a~0_363, main_#t~pre6=|v_main_#t~pre6_434|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {44363#(= main_~a~0 0)} is VALID [2022-04-15 07:22:25,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {44363#(= main_~a~0 0)} [213] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {44359#false} is VALID [2022-04-15 07:22:25,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {44359#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {44359#false} is VALID [2022-04-15 07:22:25,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {44359#false} assume !false; {44359#false} is VALID [2022-04-15 07:22:25,898 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:22:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:25,898 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674868886] [2022-04-15 07:22:25,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674868886] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:25,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:25,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:22:27,989 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:27,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1487245843] [2022-04-15 07:22:27,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1487245843] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:27,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:27,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 07:22:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602822367] [2022-04-15 07:22:27,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:27,990 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 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 142 [2022-04-15 07:22:27,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:27,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:28,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:28,054 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 07:22:28,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:28,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 07:22:28,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=3927, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 07:22:28,055 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:36,142 INFO L93 Difference]: Finished difference Result 190 states and 214 transitions. [2022-04-15 07:22:36,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 07:22:36,143 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 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 142 [2022-04-15 07:22:36,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:36,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 214 transitions. [2022-04-15 07:22:36,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 214 transitions. [2022-04-15 07:22:36,145 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 214 transitions. [2022-04-15 07:22:36,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:36,333 INFO L225 Difference]: With dead ends: 190 [2022-04-15 07:22:36,333 INFO L226 Difference]: Without dead ends: 175 [2022-04-15 07:22:36,334 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 51 SyntacticMatches, 28 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3964 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=1083, Invalid=15429, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 07:22:36,334 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 308 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 6539 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 6749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 6539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:36,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [308 Valid, 39 Invalid, 6749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 6539 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-04-15 07:22:36,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-15 07:22:36,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 147. [2022-04-15 07:22:36,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:36,469 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,469 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,469 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:36,471 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2022-04-15 07:22:36,471 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2022-04-15 07:22:36,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:36,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:36,471 INFO L74 IsIncluded]: Start isIncluded. First operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 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 175 states. [2022-04-15 07:22:36,471 INFO L87 Difference]: Start difference. First operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 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 175 states. [2022-04-15 07:22:36,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:36,473 INFO L93 Difference]: Finished difference Result 175 states and 192 transitions. [2022-04-15 07:22:36,473 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 192 transitions. [2022-04-15 07:22:36,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:36,473 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:36,473 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:36,473 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 143 states have (on average 1.0419580419580419) internal successors, (149), 143 states have internal predecessors, (149), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2022-04-15 07:22:36,480 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 142 [2022-04-15 07:22:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:36,480 INFO L478 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2022-04-15 07:22:36,481 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.106060606060606) internal successors, (139), 65 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:36,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 147 states and 152 transitions. [2022-04-15 07:22:37,146 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:37,146 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2022-04-15 07:22:37,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-15 07:22:37,146 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:37,146 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:37,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60 [2022-04-15 07:22:37,147 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:37,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:37,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1878539426, now seen corresponding path program 56 times [2022-04-15 07:22:37,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:37,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1917585318] [2022-04-15 07:22:37,923 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:22:37,992 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:22:38,089 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:22:38,158 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:22:38,254 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:22:38,328 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:22:38,472 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:22:38,560 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:22:38,817 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:22:38,818 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:22:38,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1835290795, now seen corresponding path program 1 times [2022-04-15 07:22:38,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:38,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626280022] [2022-04-15 07:22:38,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:38,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:38,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:38,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:22:38,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:38,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {45585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {45579#true} is VALID [2022-04-15 07:22:38,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {45579#true} assume true; {45579#true} is VALID [2022-04-15 07:22:38,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45579#true} {45579#true} #92#return; {45579#true} is VALID [2022-04-15 07:22:38,846 INFO L272 TraceCheckUtils]: 0: Hoare triple {45579#true} call ULTIMATE.init(); {45585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:22:38,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {45585#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {45579#true} is VALID [2022-04-15 07:22:38,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {45579#true} assume true; {45579#true} is VALID [2022-04-15 07:22:38,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {45579#true} {45579#true} #92#return; {45579#true} is VALID [2022-04-15 07:22:38,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {45579#true} call #t~ret10 := main(); {45579#true} is VALID [2022-04-15 07:22:38,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {45579#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {45584#(= main_~a~0 0)} is VALID [2022-04-15 07:22:38,847 INFO L290 TraceCheckUtils]: 6: Hoare triple {45584#(= main_~a~0 0)} [216] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~f~0_12483 v_main_~f~0_12427)) (.cse1 (= v_main_~c~0_636 v_main_~c~0_634)) (.cse2 (= |v_main_#t~pre7_675| |v_main_#t~pre7_673|)) (.cse3 (= |v_main_#t~pre4_304| |v_main_#t~pre4_303|)) (.cse4 (= v_main_~b~0_495 v_main_~b~0_493)) (.cse5 (= |v_main_#t~pre9_8408| |v_main_#t~pre9_8360|)) (.cse6 (= v_main_~e~0_4526 v_main_~e~0_4516)) (.cse7 (= |v_main_#t~pre6_442| |v_main_#t~pre6_441|)) (.cse8 (= |v_main_#t~pre5_364| |v_main_#t~pre5_363|)) (.cse9 (= v_main_~d~0_1002 v_main_~d~0_999))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_369 v_main_~a~0_370) .cse5 .cse6 .cse7 .cse8 (= |v_main_#t~pre8_3537| |v_main_#t~pre8_3545|) .cse9) (and .cse0 .cse1 (= |v_main_#t~pre8_3545| |v_main_#t~pre8_3537|) .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 (= v_main_~a~0_370 v_main_~a~0_369) .cse9))) InVars {main_~e~0=v_main_~e~0_4526, main_~d~0=v_main_~d~0_1002, main_~b~0=v_main_~b~0_495, main_~f~0=v_main_~f~0_12483, main_#t~pre7=|v_main_#t~pre7_675|, main_~c~0=v_main_~c~0_636, main_#t~pre8=|v_main_#t~pre8_3545|, main_#t~pre9=|v_main_#t~pre9_8408|, main_#t~pre4=|v_main_#t~pre4_304|, main_#t~pre5=|v_main_#t~pre5_364|, main_~a~0=v_main_~a~0_370, main_#t~pre6=|v_main_#t~pre6_442|} OutVars{main_~e~0=v_main_~e~0_4516, main_~d~0=v_main_~d~0_999, main_~b~0=v_main_~b~0_493, main_~f~0=v_main_~f~0_12427, main_#t~pre7=|v_main_#t~pre7_673|, main_~c~0=v_main_~c~0_634, main_#t~pre8=|v_main_#t~pre8_3537|, main_#t~pre9=|v_main_#t~pre9_8360|, main_#t~pre4=|v_main_#t~pre4_303|, main_#t~pre5=|v_main_#t~pre5_363|, main_~a~0=v_main_~a~0_369, main_#t~pre6=|v_main_#t~pre6_441|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {45584#(= main_~a~0 0)} is VALID [2022-04-15 07:22:38,847 INFO L290 TraceCheckUtils]: 7: Hoare triple {45584#(= main_~a~0 0)} [215] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {45580#false} is VALID [2022-04-15 07:22:38,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {45580#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {45580#false} is VALID [2022-04-15 07:22:38,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {45580#false} assume !false; {45580#false} is VALID [2022-04-15 07:22:38,847 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:22:38,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:38,847 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626280022] [2022-04-15 07:22:38,847 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626280022] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:38,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:38,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:22:41,058 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:41,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1917585318] [2022-04-15 07:22:41,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1917585318] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:41,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:41,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 07:22:41,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405344009] [2022-04-15 07:22:41,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:41,059 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 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 144 [2022-04-15 07:22:41,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:41,059 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:41,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:41,126 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 07:22:41,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:41,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 07:22:41,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4054, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 07:22:41,126 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:49,608 INFO L93 Difference]: Finished difference Result 191 states and 214 transitions. [2022-04-15 07:22:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 07:22:49,608 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 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 144 [2022-04-15 07:22:49,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:22:49,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 214 transitions. [2022-04-15 07:22:49,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 214 transitions. [2022-04-15 07:22:49,611 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 214 transitions. [2022-04-15 07:22:49,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:49,714 INFO L225 Difference]: With dead ends: 191 [2022-04-15 07:22:49,714 INFO L226 Difference]: Without dead ends: 176 [2022-04-15 07:22:49,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 52 SyntacticMatches, 28 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1098, Invalid=15932, Unknown=0, NotChecked=0, Total=17030 [2022-04-15 07:22:49,715 INFO L913 BasicCegarLoop]: 12 mSDtfsCounter, 283 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 6870 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 7062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 6870 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-04-15 07:22:49,716 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 104 Invalid, 7062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 6870 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-15 07:22:49,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-04-15 07:22:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 149. [2022-04-15 07:22:49,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:22:49,862 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,862 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,862 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:49,864 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-04-15 07:22:49,864 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2022-04-15 07:22:49,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:49,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:49,864 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 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 176 states. [2022-04-15 07:22:49,864 INFO L87 Difference]: Start difference. First operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 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 176 states. [2022-04-15 07:22:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:22:49,865 INFO L93 Difference]: Finished difference Result 176 states and 193 transitions. [2022-04-15 07:22:49,865 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 193 transitions. [2022-04-15 07:22:49,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:22:49,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:22:49,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:22:49,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:22:49,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 145 states have (on average 1.0413793103448277) internal successors, (151), 145 states have internal predecessors, (151), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 154 transitions. [2022-04-15 07:22:49,867 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 154 transitions. Word has length 144 [2022-04-15 07:22:49,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:22:49,867 INFO L478 AbstractCegarLoop]: Abstraction has 149 states and 154 transitions. [2022-04-15 07:22:49,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.1044776119402986) internal successors, (141), 66 states have internal predecessors, (141), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:49,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 149 states and 154 transitions. [2022-04-15 07:22:50,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:50,504 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 154 transitions. [2022-04-15 07:22:50,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 07:22:50,504 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:22:50,505 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:22:50,505 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61 [2022-04-15 07:22:50,505 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:22:50,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:22:50,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1024600489, now seen corresponding path program 57 times [2022-04-15 07:22:50,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:50,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1182642330] [2022-04-15 07:22:51,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:51,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:51,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:51,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:51,400 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:51,400 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:51,401 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 07:22:51,401 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-15 07:22:51,551 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 6 HavocedVariables, 6 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=5}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:22:51,551 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:22:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1835352299, now seen corresponding path program 1 times [2022-04-15 07:22:51,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:22:51,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388491079] [2022-04-15 07:22:51,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:22:51,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:22:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:51,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:22:51,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:22:51,584 INFO L290 TraceCheckUtils]: 0: Hoare triple {46817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {46811#true} assume true; {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46811#true} {46811#true} #92#return; {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {46811#true} call ULTIMATE.init(); {46817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:22:51,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {46817#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;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); {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {46811#true} assume true; {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46811#true} {46811#true} #92#return; {46811#true} is VALID [2022-04-15 07:22:51,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {46811#true} call #t~ret10 := main(); {46811#true} is VALID [2022-04-15 07:22:51,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {46811#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~d~0 := 6;~e~0 := 6;~f~0 := 6;~a~0 := 0; {46816#(= main_~a~0 0)} is VALID [2022-04-15 07:22:51,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {46816#(= main_~a~0 0)} [218] L23-3-->L23-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_646 v_main_~c~0_644)) (.cse1 (= |v_main_#t~pre5_370| |v_main_#t~pre5_369|)) (.cse2 (= v_main_~a~0_376 v_main_~a~0_375)) (.cse3 (= v_main_~d~0_1026 v_main_~d~0_1023)) (.cse4 (= v_main_~f~0_12792 v_main_~f~0_12735)) (.cse5 (= |v_main_#t~pre6_449| |v_main_#t~pre6_448|)) (.cse6 (= v_main_~b~0_503 v_main_~b~0_501)) (.cse7 (= |v_main_#t~pre4_309| |v_main_#t~pre4_308|)) (.cse8 (= |v_main_#t~pre7_690| |v_main_#t~pre7_688|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre9_8614| |v_main_#t~pre9_8566|) .cse3 .cse4 (= v_main_~e~0_4599 v_main_~e~0_4588) .cse5 (= |v_main_#t~pre8_3591| |v_main_#t~pre8_3582|) .cse6 .cse7 .cse8) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre9_8566| |v_main_#t~pre9_8614|) .cse3 .cse4 .cse5 (= |v_main_#t~pre8_3582| |v_main_#t~pre8_3591|) .cse6 (= v_main_~e~0_4588 v_main_~e~0_4599) .cse7 .cse8))) InVars {main_~e~0=v_main_~e~0_4599, main_~d~0=v_main_~d~0_1026, main_~b~0=v_main_~b~0_503, main_~f~0=v_main_~f~0_12792, main_#t~pre7=|v_main_#t~pre7_690|, main_~c~0=v_main_~c~0_646, main_#t~pre8=|v_main_#t~pre8_3591|, main_#t~pre9=|v_main_#t~pre9_8614|, main_#t~pre4=|v_main_#t~pre4_309|, main_#t~pre5=|v_main_#t~pre5_370|, main_~a~0=v_main_~a~0_376, main_#t~pre6=|v_main_#t~pre6_449|} OutVars{main_~e~0=v_main_~e~0_4588, main_~d~0=v_main_~d~0_1023, main_~b~0=v_main_~b~0_501, main_~f~0=v_main_~f~0_12735, main_#t~pre7=|v_main_#t~pre7_688|, main_~c~0=v_main_~c~0_644, main_#t~pre8=|v_main_#t~pre8_3582|, main_#t~pre9=|v_main_#t~pre9_8566|, main_#t~pre4=|v_main_#t~pre4_308|, main_#t~pre5=|v_main_#t~pre5_369|, main_~a~0=v_main_~a~0_375, main_#t~pre6=|v_main_#t~pre6_448|} AuxVars[] AssignedVars[main_~e~0, main_~f~0, main_#t~pre7, main_~c~0, main_#t~pre8, main_~d~0, main_#t~pre9, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {46816#(= main_~a~0 0)} is VALID [2022-04-15 07:22:51,585 INFO L290 TraceCheckUtils]: 7: Hoare triple {46816#(= main_~a~0 0)} [217] L23-4_primed-->L23-4: Formula: (not (< v_main_~a~0_3 6)) InVars {main_~a~0=v_main_~a~0_3} OutVars{main_~a~0=v_main_~a~0_3} AuxVars[] AssignedVars[] {46812#false} is VALID [2022-04-15 07:22:51,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {46812#false} assume !(((((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0) && 6 == ~d~0) && 6 == ~e~0) && 6 == ~f~0); {46812#false} is VALID [2022-04-15 07:22:51,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {46812#false} assume !false; {46812#false} is VALID [2022-04-15 07:22:51,586 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:22:51,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:22:51,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388491079] [2022-04-15 07:22:51,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388491079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:51,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:51,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:22:53,903 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:22:53,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1182642330] [2022-04-15 07:22:53,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1182642330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:22:53,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:22:53,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 07:22:53,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83614296] [2022-04-15 07:22:53,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:22:53,904 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 67 states have internal predecessors, (144), 1 states have call successors, (2), 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 147 [2022-04-15 07:22:53,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:22:53,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 67 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:22:53,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:22:53,971 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 07:22:53,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:22:53,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 07:22:53,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=373, Invalid=4183, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 07:22:53,972 INFO L87 Difference]: Start difference. First operand 149 states and 154 transitions. Second operand has 68 states, 68 states have (on average 2.1176470588235294) internal successors, (144), 67 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)