/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/nested_3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:07:17,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:07:17,584 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:07:17,653 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:07:17,653 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:07:17,654 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:07:17,655 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:07:17,657 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:07:17,658 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:07:17,659 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:07:17,659 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:07:17,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:07:17,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:07:17,662 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:07:17,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:07:17,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:07:17,664 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:07:17,665 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:07:17,666 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:07:17,668 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:07:17,669 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:07:17,670 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:07:17,671 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:07:17,672 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:07:17,672 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:07:17,675 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:07:17,675 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:07:17,675 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:07:17,676 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:07:17,676 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:07:17,677 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:07:17,677 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:07:17,678 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:07:17,679 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:07:17,679 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:07:17,680 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:07:17,680 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:07:17,681 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:07:17,681 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:07:17,681 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:07:17,682 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:07:17,682 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:07:17,683 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 04:07:17,690 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:07:17,691 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:07:17,692 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:07:17,692 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:07:17,692 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:07:17,692 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:07:17,692 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:07:17,692 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:07:17,693 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:07:17,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:07:17,694 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:07:17,694 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:07:17,694 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:07:17,694 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:07:17,694 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:07:17,694 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:07:17,695 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:07:17,695 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:07:17,695 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:07:17,695 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:07:17,695 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 04:07:17,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:07:17,936 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:07:17,938 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:07:17,939 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:07:17,940 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:07:17,941 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-28 04:07:17,991 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb03d3293/62e0463a36c1402a892753daab2afc13/FLAG6e0fdb5f0 [2022-04-28 04:07:18,384 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:07:18,385 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c [2022-04-28 04:07:18,390 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb03d3293/62e0463a36c1402a892753daab2afc13/FLAG6e0fdb5f0 [2022-04-28 04:07:18,405 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb03d3293/62e0463a36c1402a892753daab2afc13 [2022-04-28 04:07:18,407 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:07:18,409 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:07:18,411 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:07:18,411 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:07:18,414 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:07:18,415 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,416 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6859a16c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18, skipping insertion in model container [2022-04-28 04:07:18,416 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,421 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:07:18,431 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:07:18,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-28 04:07:18,587 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:07:18,594 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:07:18,612 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_3.c[784,797] [2022-04-28 04:07:18,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:07:18,625 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:07:18,626 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18 WrapperNode [2022-04-28 04:07:18,626 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:07:18,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:07:18,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:07:18,627 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:07:18,635 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,635 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,642 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,643 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,653 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,658 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,659 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,664 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:07:18,665 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:07:18,665 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:07:18,665 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:07:18,666 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (1/1) ... [2022-04-28 04:07:18,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:07:18,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:07:18,696 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 04:07:18,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 04:07:18,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:07:18,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:07:18,734 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:07:18,734 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:07:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:07:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:07:18,734 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:07:18,735 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:07:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:07:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:07:18,736 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:07:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:07:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:07:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:07:18,787 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:07:18,788 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:07:18,936 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:07:18,949 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:07:18,949 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-28 04:07:18,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:07:18 BoogieIcfgContainer [2022-04-28 04:07:18,950 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:07:18,952 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:07:18,952 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:07:18,956 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:07:18,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:07:18" (1/3) ... [2022-04-28 04:07:18,956 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1273d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:07:18, skipping insertion in model container [2022-04-28 04:07:18,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:07:18" (2/3) ... [2022-04-28 04:07:18,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1273d260 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:07:18, skipping insertion in model container [2022-04-28 04:07:18,957 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:07:18" (3/3) ... [2022-04-28 04:07:18,958 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_3.c [2022-04-28 04:07:18,968 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:07:18,968 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:07:19,001 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:07:19,006 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@423d388e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2d35d72b [2022-04-28 04:07:19,006 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:07:19,017 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:07:19,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:07:19,036 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:19,036 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:19,036 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:19,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:19,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 1 times [2022-04-28 04:07:19,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:19,050 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1629199573] [2022-04-28 04:07:19,067 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:07:19,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1607939523, now seen corresponding path program 2 times [2022-04-28 04:07:19,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:19,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535466346] [2022-04-28 04:07:19,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:19,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:19,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:19,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:19,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:07:19,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:07:19,252 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 04:07:19,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:19,257 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {23#true} is VALID [2022-04-28 04:07:19,257 INFO L290 TraceCheckUtils]: 2: Hoare triple {23#true} assume true; {23#true} is VALID [2022-04-28 04:07:19,257 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23#true} {23#true} #56#return; {23#true} is VALID [2022-04-28 04:07:19,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {23#true} call #t~ret7 := main(); {23#true} is VALID [2022-04-28 04:07:19,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {23#true} is VALID [2022-04-28 04:07:19,259 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#true} assume !true; {24#false} is VALID [2022-04-28 04:07:19,259 INFO L290 TraceCheckUtils]: 7: Hoare triple {24#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {24#false} is VALID [2022-04-28 04:07:19,260 INFO L290 TraceCheckUtils]: 8: Hoare triple {24#false} assume !false; {24#false} is VALID [2022-04-28 04:07:19,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:19,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:19,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535466346] [2022-04-28 04:07:19,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535466346] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:19,261 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:19,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:07:19,265 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:19,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1629199573] [2022-04-28 04:07:19,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1629199573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:19,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:19,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 04:07:19,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296842226] [2022-04-28 04:07:19,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:19,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:19,273 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:19,276 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,293 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-28 04:07:19,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 04:07:19,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:19,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 04:07:19,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:07:19,317 INFO L87 Difference]: Start difference. First operand has 20 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,410 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 04:07:19,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 04:07:19,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-28 04:07:19,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:19,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 04:07:19,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-04-28 04:07:19,429 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-04-28 04:07:19,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:19,500 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:07:19,500 INFO L226 Difference]: Without dead ends: 15 [2022-04-28 04:07:19,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 04:07:19,506 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:19,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 25 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:19,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-28 04:07:19,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-28 04:07:19,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:19,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,541 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,541 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,551 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 04:07:19,551 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 04:07:19,552 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:19,552 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:19,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:07:19,553 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 15 states. [2022-04-28 04:07:19,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,556 INFO L93 Difference]: Finished difference Result 15 states and 17 transitions. [2022-04-28 04:07:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 04:07:19,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:19,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:19,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:19,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:19,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 17 transitions. [2022-04-28 04:07:19,560 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 17 transitions. Word has length 9 [2022-04-28 04:07:19,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:19,561 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 17 transitions. [2022-04-28 04:07:19,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 17 transitions. [2022-04-28 04:07:19,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:19,583 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 17 transitions. [2022-04-28 04:07:19,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:07:19,584 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:19,584 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:19,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:07:19,585 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:19,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:19,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 1 times [2022-04-28 04:07:19,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:19,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [905724933] [2022-04-28 04:07:19,598 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:07:19,598 INFO L85 PathProgramCache]: Analyzing trace with hash -1607968353, now seen corresponding path program 2 times [2022-04-28 04:07:19,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:19,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799671062] [2022-04-28 04:07:19,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:19,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:19,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:19,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:19,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:19,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-28 04:07:19,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 04:07:19,684 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-28 04:07:19,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {159#true} call ULTIMATE.init(); {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:19,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {159#true} is VALID [2022-04-28 04:07:19,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {159#true} assume true; {159#true} is VALID [2022-04-28 04:07:19,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159#true} {159#true} #56#return; {159#true} is VALID [2022-04-28 04:07:19,686 INFO L272 TraceCheckUtils]: 4: Hoare triple {159#true} call #t~ret7 := main(); {159#true} is VALID [2022-04-28 04:07:19,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {159#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {164#(= main_~a~0 0)} is VALID [2022-04-28 04:07:19,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {164#(= main_~a~0 0)} assume !(~a~0 < 6); {160#false} is VALID [2022-04-28 04:07:19,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {160#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {160#false} is VALID [2022-04-28 04:07:19,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {160#false} assume !false; {160#false} is VALID [2022-04-28 04:07:19,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799671062] [2022-04-28 04:07:19,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799671062] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:19,688 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:19,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:19,688 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:19,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [905724933] [2022-04-28 04:07:19,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [905724933] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:19,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:19,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279839209] [2022-04-28 04:07:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:19,690 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-28 04:07:19,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:19,690 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-28 04:07:19,698 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-28 04:07:19,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:07:19,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:19,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:07:19,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:07:19,700 INFO L87 Difference]: Start difference. First operand 15 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,758 INFO L93 Difference]: Finished difference Result 24 states and 28 transitions. [2022-04-28 04:07:19,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:07:19,758 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-28 04:07:19,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:19,758 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-28 04:07:19,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 04:07:19,760 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-28 04:07:19,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 28 transitions. [2022-04-28 04:07:19,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 28 transitions. [2022-04-28 04:07:19,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:19,806 INFO L225 Difference]: With dead ends: 24 [2022-04-28 04:07:19,806 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:07:19,806 INFO L412 NwaCegarLoop]: 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-28 04:07:19,807 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:19,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:19,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:07:19,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 16. [2022-04-28 04:07:19,812 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:19,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,812 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,813 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,814 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-28 04:07:19,814 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 04:07:19,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:19,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:19,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:07:19,815 INFO L87 Difference]: Start difference. First operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:07:19,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:19,818 INFO L93 Difference]: Finished difference Result 21 states and 25 transitions. [2022-04-28 04:07:19,818 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-28 04:07:19,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:19,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:19,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:19,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 12 states have (on average 1.25) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:19,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 18 transitions. [2022-04-28 04:07:19,821 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 18 transitions. Word has length 9 [2022-04-28 04:07:19,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:19,821 INFO L495 AbstractCegarLoop]: Abstraction has 16 states and 18 transitions. [2022-04-28 04:07:19,822 INFO L496 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-28 04:07:19,822 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 18 transitions. [2022-04-28 04:07:19,842 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-28 04:07:19,842 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 18 transitions. [2022-04-28 04:07:19,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:07:19,843 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:19,843 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:19,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:07:19,843 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:19,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:19,844 INFO L85 PathProgramCache]: Analyzing trace with hash -1181899718, now seen corresponding path program 1 times [2022-04-28 04:07:19,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:19,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1801190364] [2022-04-28 04:07:19,939 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:19,939 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:19,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1694000335, now seen corresponding path program 1 times [2022-04-28 04:07:19,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:19,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439523909] [2022-04-28 04:07:19,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:19,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:20,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:20,021 INFO L290 TraceCheckUtils]: 0: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 04:07:20,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:07:20,022 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-28 04:07:20,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {292#true} call ULTIMATE.init(); {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:20,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {298#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {292#true} is VALID [2022-04-28 04:07:20,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#true} assume true; {292#true} is VALID [2022-04-28 04:07:20,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {292#true} {292#true} #56#return; {292#true} is VALID [2022-04-28 04:07:20,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {292#true} call #t~ret7 := main(); {292#true} is VALID [2022-04-28 04:07:20,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {292#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {297#(= main_~a~0 0)} is VALID [2022-04-28 04:07:20,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {297#(= main_~a~0 0)} [60] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (= v_main_~b~0_10 v_main_~b~0_9) .cse0 (= v_main_~a~0_10 v_main_~a~0_9)) (and (= v_main_~b~0_9 v_main_~b~0_10) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)))) InVars {main_~b~0=v_main_~b~0_10, main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_~b~0=v_main_~b~0_9, main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_~a~0] {297#(= main_~a~0 0)} is VALID [2022-04-28 04:07:20,025 INFO L290 TraceCheckUtils]: 7: Hoare triple {297#(= main_~a~0 0)} [59] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {293#false} is VALID [2022-04-28 04:07:20,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {293#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {293#false} is VALID [2022-04-28 04:07:20,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {293#false} assume !false; {293#false} is VALID [2022-04-28 04:07:20,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:20,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:20,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439523909] [2022-04-28 04:07:20,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439523909] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:20,027 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:20,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:20,050 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:20,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1801190364] [2022-04-28 04:07:20,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1801190364] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:20,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:20,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:07:20,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699091440] [2022-04-28 04:07:20,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:20,053 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-28 04:07:20,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:20,053 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-28 04:07:20,064 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-28 04:07:20,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:07:20,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:20,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:07:20,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:07:20,065 INFO L87 Difference]: Start difference. First operand 16 states and 18 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,162 INFO L93 Difference]: Finished difference Result 34 states and 42 transitions. [2022-04-28 04:07:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:07:20,162 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-28 04:07:20,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:20,163 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-28 04:07:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-28 04:07:20,165 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-28 04:07:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 42 transitions. [2022-04-28 04:07:20,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 42 transitions. [2022-04-28 04:07:20,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:20,218 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:07:20,218 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:07:20,219 INFO L412 NwaCegarLoop]: 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-28 04:07:20,222 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 38 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:20,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:07:20,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 17. [2022-04-28 04:07:20,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:20,227 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,228 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,228 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,229 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 04:07:20,230 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 04:07:20,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:20,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:20,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 04:07:20,231 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-28 04:07:20,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,232 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2022-04-28 04:07:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-04-28 04:07:20,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:20,233 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:20,233 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:20,233 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:20,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 19 transitions. [2022-04-28 04:07:20,234 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 19 transitions. Word has length 12 [2022-04-28 04:07:20,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:20,234 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 19 transitions. [2022-04-28 04:07:20,235 INFO L496 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-28 04:07:20,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 19 transitions. [2022-04-28 04:07:20,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:20,257 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 04:07:20,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-28 04:07:20,259 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:20,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:20,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:07:20,261 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:20,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:20,262 INFO L85 PathProgramCache]: Analyzing trace with hash -2039168997, now seen corresponding path program 1 times [2022-04-28 04:07:20,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:20,263 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [507452979] [2022-04-28 04:07:20,312 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-28 04:07:20,406 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-28 04:07:20,406 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:20,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1694061839, now seen corresponding path program 1 times [2022-04-28 04:07:20,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:20,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890239510] [2022-04-28 04:07:20,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:20,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:20,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:20,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:20,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:20,472 INFO L290 TraceCheckUtils]: 0: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-28 04:07:20,472 INFO L290 TraceCheckUtils]: 1: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-28 04:07:20,472 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {458#true} {458#true} #56#return; {458#true} is VALID [2022-04-28 04:07:20,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {458#true} call ULTIMATE.init(); {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:20,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {458#true} is VALID [2022-04-28 04:07:20,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {458#true} assume true; {458#true} is VALID [2022-04-28 04:07:20,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {458#true} {458#true} #56#return; {458#true} is VALID [2022-04-28 04:07:20,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {458#true} call #t~ret7 := main(); {458#true} is VALID [2022-04-28 04:07:20,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {458#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {463#(= main_~a~0 0)} is VALID [2022-04-28 04:07:20,475 INFO L290 TraceCheckUtils]: 6: Hoare triple {463#(= main_~a~0 0)} [62] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|)) (.cse1 (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|)) (.cse2 (= v_main_~a~0_16 v_main_~a~0_15)) (.cse3 (= v_main_~b~0_23 v_main_~b~0_21))) (or (and .cse0 (= v_main_~c~0_16 v_main_~c~0_15) .cse1 .cse2 .cse3) (and .cse0 .cse1 (= v_main_~c~0_15 v_main_~c~0_16) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_16, main_~b~0=v_main_~b~0_23, main_#t~pre4=|v_main_#t~pre4_9|, main_#t~pre5=|v_main_#t~pre5_10|, main_~a~0=v_main_~a~0_16} OutVars{main_~c~0=v_main_~c~0_15, main_~b~0=v_main_~b~0_21, main_#t~pre4=|v_main_#t~pre4_8|, main_#t~pre5=|v_main_#t~pre5_9|, main_~a~0=v_main_~a~0_15} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {463#(= main_~a~0 0)} is VALID [2022-04-28 04:07:20,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {463#(= main_~a~0 0)} [61] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {459#false} is VALID [2022-04-28 04:07:20,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {459#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {459#false} is VALID [2022-04-28 04:07:20,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {459#false} assume !false; {459#false} is VALID [2022-04-28 04:07:20,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:20,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:20,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890239510] [2022-04-28 04:07:20,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890239510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:20,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:20,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:20,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:20,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [507452979] [2022-04-28 04:07:20,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [507452979] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:20,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:20,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:07:20,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053930210] [2022-04-28 04:07:20,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:20,508 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-28 04:07:20,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:20,509 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-28 04:07:20,525 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-28 04:07:20,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:07:20,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:20,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:07:20,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:07:20,526 INFO L87 Difference]: Start difference. First operand 17 states and 19 transitions. Second operand has 6 states, 6 states have (on average 2.0) internal successors, (12), 5 states have internal predecessors, (12), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,687 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-28 04:07:20,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:07:20,687 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-28 04:07:20,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:20,688 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-28 04:07:20,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:07:20,689 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-28 04:07:20,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 44 transitions. [2022-04-28 04:07:20,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 44 transitions. [2022-04-28 04:07:20,746 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:20,747 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:07:20,747 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:07:20,748 INFO L412 NwaCegarLoop]: 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-28 04:07:20,748 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:20,749 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 23 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:20,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:07:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 18. [2022-04-28 04:07:20,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:20,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,757 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,757 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,758 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 04:07:20,758 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 04:07:20,759 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:20,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:20,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 04:07:20,771 INFO L87 Difference]: Start difference. First operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 27 states. [2022-04-28 04:07:20,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:20,772 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-28 04:07:20,772 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-28 04:07:20,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:20,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:20,773 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:20,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-28 04:07:20,774 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 15 [2022-04-28 04:07:20,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:20,774 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-28 04:07:20,775 INFO L496 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-28 04:07:20,775 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-28 04:07:20,810 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:20,810 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-28 04:07:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-28 04:07:20,810 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:20,811 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:20,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:07:20,811 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:20,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash -434811975, now seen corresponding path program 1 times [2022-04-28 04:07:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:20,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913614826] [2022-04-28 04:07:20,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:21,171 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:21,232 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-28 04:07:21,318 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:21,318 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash 1694123343, now seen corresponding path program 1 times [2022-04-28 04:07:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:21,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575550964] [2022-04-28 04:07:21,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:21,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:21,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:21,377 INFO L290 TraceCheckUtils]: 0: Hoare triple {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {637#true} is VALID [2022-04-28 04:07:21,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {637#true} assume true; {637#true} is VALID [2022-04-28 04:07:21,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {637#true} {637#true} #56#return; {637#true} is VALID [2022-04-28 04:07:21,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {637#true} call ULTIMATE.init(); {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:21,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {643#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {637#true} is VALID [2022-04-28 04:07:21,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {637#true} assume true; {637#true} is VALID [2022-04-28 04:07:21,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {637#true} {637#true} #56#return; {637#true} is VALID [2022-04-28 04:07:21,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {637#true} call #t~ret7 := main(); {637#true} is VALID [2022-04-28 04:07:21,379 INFO L290 TraceCheckUtils]: 5: Hoare triple {637#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {642#(= main_~a~0 0)} is VALID [2022-04-28 04:07:21,380 INFO L290 TraceCheckUtils]: 6: Hoare triple {642#(= main_~a~0 0)} [64] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_36 v_main_~b~0_34) (= |v_main_#t~pre5_21| |v_main_#t~pre5_20|) (= v_main_~a~0_22 v_main_~a~0_21) (= |v_main_#t~pre6_21| |v_main_#t~pre6_20|) (= v_main_~c~0_41 v_main_~c~0_39) (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|)) InVars {main_~c~0=v_main_~c~0_41, main_~b~0=v_main_~b~0_36, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_22, main_#t~pre6=|v_main_#t~pre6_21|} OutVars{main_~c~0=v_main_~c~0_39, main_~b~0=v_main_~b~0_34, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_20|, main_~a~0=v_main_~a~0_21, main_#t~pre6=|v_main_#t~pre6_20|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {642#(= main_~a~0 0)} is VALID [2022-04-28 04:07:21,380 INFO L290 TraceCheckUtils]: 7: Hoare triple {642#(= main_~a~0 0)} [63] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {638#false} is VALID [2022-04-28 04:07:21,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {638#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {638#false} is VALID [2022-04-28 04:07:21,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {638#false} assume !false; {638#false} is VALID [2022-04-28 04:07:21,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:21,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:21,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575550964] [2022-04-28 04:07:21,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575550964] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:21,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:21,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:21,425 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:21,425 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913614826] [2022-04-28 04:07:21,425 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913614826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:21,425 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:21,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:07:21,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111218666] [2022-04-28 04:07:21,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:21,426 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 04:07:21,426 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:21,426 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:21,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:07:21,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:21,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:07:21,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:07:21,445 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:21,591 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-04-28 04:07:21,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:07:21,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-04-28 04:07:21,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:21,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 04:07:21,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 46 transitions. [2022-04-28 04:07:21,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 46 transitions. [2022-04-28 04:07:21,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:21,635 INFO L225 Difference]: With dead ends: 38 [2022-04-28 04:07:21,635 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:07:21,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=68, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:07:21,636 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:21,637 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 23 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:21,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:07:21,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 20. [2022-04-28 04:07:21,641 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:21,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,642 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,642 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:21,643 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 04:07:21,643 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 04:07:21,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:21,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:21,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 04:07:21,644 INFO L87 Difference]: Start difference. First operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 29 states. [2022-04-28 04:07:21,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:21,645 INFO L93 Difference]: Finished difference Result 29 states and 34 transitions. [2022-04-28 04:07:21,645 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-04-28 04:07:21,646 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:21,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:21,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:21,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:21,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2022-04-28 04:07:21,647 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2022-04-28 04:07:21,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:21,647 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2022-04-28 04:07:21,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 6 states have internal predecessors, (14), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:21,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 22 transitions. [2022-04-28 04:07:21,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:21,668 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2022-04-28 04:07:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-28 04:07:21,668 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:21,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:21,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 04:07:21,669 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:21,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:21,669 INFO L85 PathProgramCache]: Analyzing trace with hash -540973097, now seen corresponding path program 2 times [2022-04-28 04:07:21,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:21,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244054177] [2022-04-28 04:07:25,786 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:25,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:30,029 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:30,116 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:30,172 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-28 04:07:30,277 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:30,278 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:30,279 INFO L85 PathProgramCache]: Analyzing trace with hash 1694184847, now seen corresponding path program 1 times [2022-04-28 04:07:30,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:30,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268073637] [2022-04-28 04:07:30,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:30,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:30,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:30,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:30,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-28 04:07:30,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-28 04:07:30,345 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {831#true} {831#true} #56#return; {831#true} is VALID [2022-04-28 04:07:30,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {831#true} call ULTIMATE.init(); {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:30,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {837#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {831#true} is VALID [2022-04-28 04:07:30,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {831#true} assume true; {831#true} is VALID [2022-04-28 04:07:30,347 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {831#true} {831#true} #56#return; {831#true} is VALID [2022-04-28 04:07:30,347 INFO L272 TraceCheckUtils]: 4: Hoare triple {831#true} call #t~ret7 := main(); {831#true} is VALID [2022-04-28 04:07:30,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {831#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {836#(= main_~a~0 0)} is VALID [2022-04-28 04:07:30,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#(= main_~a~0 0)} [66] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_46| |v_main_#t~pre6_44|)) (.cse1 (= |v_main_#t~pre5_32| |v_main_#t~pre5_31|)) (.cse2 (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|)) (.cse3 (= v_main_~a~0_28 v_main_~a~0_27))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~c~0_68 v_main_~c~0_71) (= v_main_~b~0_47 v_main_~b~0_49)) (and .cse0 .cse1 .cse2 (= v_main_~b~0_49 v_main_~b~0_47) .cse3 (= v_main_~c~0_71 v_main_~c~0_68)))) InVars {main_~c~0=v_main_~c~0_71, main_~b~0=v_main_~b~0_49, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_32|, main_~a~0=v_main_~a~0_28, main_#t~pre6=|v_main_#t~pre6_46|} OutVars{main_~c~0=v_main_~c~0_68, main_~b~0=v_main_~b~0_47, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_31|, main_~a~0=v_main_~a~0_27, main_#t~pre6=|v_main_#t~pre6_44|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {836#(= main_~a~0 0)} is VALID [2022-04-28 04:07:30,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#(= main_~a~0 0)} [65] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {832#false} is VALID [2022-04-28 04:07:30,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {832#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {832#false} is VALID [2022-04-28 04:07:30,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {832#false} assume !false; {832#false} is VALID [2022-04-28 04:07:30,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:30,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:30,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268073637] [2022-04-28 04:07:30,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268073637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:30,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:30,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:30,416 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:30,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244054177] [2022-04-28 04:07:30,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244054177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:30,416 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:30,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:07:30,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78321838] [2022-04-28 04:07:30,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:30,418 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 04:07:30,418 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:30,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:30,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:07:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:30,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:07:30,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:07:30,436 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:30,639 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2022-04-28 04:07:30,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:07:30,640 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-04-28 04:07:30,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:30,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:07:30,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 48 transitions. [2022-04-28 04:07:30,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 48 transitions. [2022-04-28 04:07:30,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:30,695 INFO L225 Difference]: With dead ends: 40 [2022-04-28 04:07:30,695 INFO L226 Difference]: Without dead ends: 31 [2022-04-28 04:07:30,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:07:30,696 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:30,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 28 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:30,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-28 04:07:30,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 22. [2022-04-28 04:07:30,701 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:30,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,701 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,702 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:30,703 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 04:07:30,703 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 04:07:30,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:30,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:30,703 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 04:07:30,704 INFO L87 Difference]: Start difference. First operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 31 states. [2022-04-28 04:07:30,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:30,705 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-28 04:07:30,705 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-28 04:07:30,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:30,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:30,705 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:30,705 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:30,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2022-04-28 04:07:30,706 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 19 [2022-04-28 04:07:30,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:30,707 INFO L495 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2022-04-28 04:07:30,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:30,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 24 transitions. [2022-04-28 04:07:30,733 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-28 04:07:30,733 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2022-04-28 04:07:30,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 04:07:30,733 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:30,734 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:30,734 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 04:07:30,734 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:30,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:30,734 INFO L85 PathProgramCache]: Analyzing trace with hash 517403765, now seen corresponding path program 3 times [2022-04-28 04:07:30,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:30,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1100662918] [2022-04-28 04:07:30,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:31,064 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:31,132 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:31,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:31,230 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:31,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1694246351, now seen corresponding path program 1 times [2022-04-28 04:07:31,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:31,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876014951] [2022-04-28 04:07:31,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:31,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:31,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:31,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-28 04:07:31,282 INFO L290 TraceCheckUtils]: 1: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-28 04:07:31,283 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1040#true} {1040#true} #56#return; {1040#true} is VALID [2022-04-28 04:07:31,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {1040#true} call ULTIMATE.init(); {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:31,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {1046#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1040#true} is VALID [2022-04-28 04:07:31,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {1040#true} assume true; {1040#true} is VALID [2022-04-28 04:07:31,284 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1040#true} {1040#true} #56#return; {1040#true} is VALID [2022-04-28 04:07:31,284 INFO L272 TraceCheckUtils]: 4: Hoare triple {1040#true} call #t~ret7 := main(); {1040#true} is VALID [2022-04-28 04:07:31,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {1040#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1045#(= main_~a~0 0)} is VALID [2022-04-28 04:07:31,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {1045#(= main_~a~0 0)} [68] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_104 v_main_~c~0_100) (= v_main_~b~0_62 v_main_~b~0_60) (= |v_main_#t~pre6_73| |v_main_#t~pre6_70|) (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|) (= |v_main_#t~pre5_43| |v_main_#t~pre5_42|) (= v_main_~a~0_34 v_main_~a~0_33)) InVars {main_~c~0=v_main_~c~0_104, main_~b~0=v_main_~b~0_62, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_43|, main_~a~0=v_main_~a~0_34, main_#t~pre6=|v_main_#t~pre6_73|} OutVars{main_~c~0=v_main_~c~0_100, main_~b~0=v_main_~b~0_60, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_42|, main_~a~0=v_main_~a~0_33, main_#t~pre6=|v_main_#t~pre6_70|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1045#(= main_~a~0 0)} is VALID [2022-04-28 04:07:31,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {1045#(= main_~a~0 0)} [67] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1041#false} is VALID [2022-04-28 04:07:31,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {1041#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1041#false} is VALID [2022-04-28 04:07:31,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {1041#false} assume !false; {1041#false} is VALID [2022-04-28 04:07:31,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:31,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:31,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876014951] [2022-04-28 04:07:31,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876014951] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:31,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:31,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:31,387 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:31,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1100662918] [2022-04-28 04:07:31,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1100662918] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:31,388 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:31,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:07:31,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502271612] [2022-04-28 04:07:31,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:31,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 04:07:31,389 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:31,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:31,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:07:31,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:31,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:07:31,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:07:31,408 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:31,655 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-04-28 04:07:31,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:07:31,655 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-04-28 04:07:31,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 04:07:31,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 50 transitions. [2022-04-28 04:07:31,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 50 transitions. [2022-04-28 04:07:31,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:31,715 INFO L225 Difference]: With dead ends: 42 [2022-04-28 04:07:31,715 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 04:07:31,716 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:31,716 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 42 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:31,717 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 28 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:31,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 04:07:31,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-04-28 04:07:31,731 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:31,732 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,732 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,732 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:31,734 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 04:07:31,734 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 04:07:31,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:31,734 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:31,734 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 04:07:31,735 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-28 04:07:31,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:31,736 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-04-28 04:07:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-04-28 04:07:31,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:31,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:31,736 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:31,736 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:31,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-04-28 04:07:31,737 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 21 [2022-04-28 04:07:31,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:31,738 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-04-28 04:07:31,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.0) internal successors, (18), 8 states have internal predecessors, (18), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:31,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 26 transitions. [2022-04-28 04:07:31,763 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:31,763 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-04-28 04:07:31,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 04:07:31,764 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:31,764 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:31,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 04:07:31,764 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:31,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:31,765 INFO L85 PathProgramCache]: Analyzing trace with hash -289681005, now seen corresponding path program 4 times [2022-04-28 04:07:31,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:31,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [963319327] [2022-04-28 04:07:34,686 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:34,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-28 04:07:38,858 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:38,924 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:38,967 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-28 04:07:39,053 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:39,053 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:39,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1694307855, now seen corresponding path program 1 times [2022-04-28 04:07:39,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:39,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134024017] [2022-04-28 04:07:39,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:39,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:39,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:39,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:39,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1264#true} is VALID [2022-04-28 04:07:39,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 04:07:39,085 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1264#true} {1264#true} #56#return; {1264#true} is VALID [2022-04-28 04:07:39,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {1264#true} call ULTIMATE.init(); {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:39,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {1270#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1264#true} is VALID [2022-04-28 04:07:39,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {1264#true} assume true; {1264#true} is VALID [2022-04-28 04:07:39,086 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1264#true} {1264#true} #56#return; {1264#true} is VALID [2022-04-28 04:07:39,086 INFO L272 TraceCheckUtils]: 4: Hoare triple {1264#true} call #t~ret7 := main(); {1264#true} is VALID [2022-04-28 04:07:39,086 INFO L290 TraceCheckUtils]: 5: Hoare triple {1264#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1269#(= main_~a~0 0)} is VALID [2022-04-28 04:07:39,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {1269#(= main_~a~0 0)} [70] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_54| |v_main_#t~pre5_53|)) (.cse1 (= v_main_~a~0_40 v_main_~a~0_39)) (.cse2 (= v_main_~c~0_140 v_main_~c~0_135)) (.cse3 (= v_main_~b~0_75 v_main_~b~0_73)) (.cse4 (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|))) (or (and .cse0 .cse1 (= |v_main_#t~pre6_98| |v_main_#t~pre6_102|) .cse2 .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre6_102| |v_main_#t~pre6_98|) .cse4))) InVars {main_~c~0=v_main_~c~0_140, main_~b~0=v_main_~b~0_75, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_54|, main_~a~0=v_main_~a~0_40, main_#t~pre6=|v_main_#t~pre6_102|} OutVars{main_~c~0=v_main_~c~0_135, main_~b~0=v_main_~b~0_73, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_53|, main_~a~0=v_main_~a~0_39, main_#t~pre6=|v_main_#t~pre6_98|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1269#(= main_~a~0 0)} is VALID [2022-04-28 04:07:39,088 INFO L290 TraceCheckUtils]: 7: Hoare triple {1269#(= main_~a~0 0)} [69] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1265#false} is VALID [2022-04-28 04:07:39,088 INFO L290 TraceCheckUtils]: 8: Hoare triple {1265#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1265#false} is VALID [2022-04-28 04:07:39,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {1265#false} assume !false; {1265#false} is VALID [2022-04-28 04:07:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:39,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:39,088 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134024017] [2022-04-28 04:07:39,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134024017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:39,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:39,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:39,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:39,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [963319327] [2022-04-28 04:07:39,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [963319327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:39,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:39,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:07:39,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629025383] [2022-04-28 04:07:39,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:39,203 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 04:07:39,203 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:39,203 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,222 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:07:39,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:39,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:07:39,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:39,223 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,474 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-28 04:07:39,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:07:39,474 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-04-28 04:07:39,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:39,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 04:07:39,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 52 transitions. [2022-04-28 04:07:39,477 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 52 transitions. [2022-04-28 04:07:39,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,526 INFO L225 Difference]: With dead ends: 44 [2022-04-28 04:07:39,526 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 04:07:39,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=194, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:07:39,527 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 53 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:39,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 18 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:39,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 04:07:39,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 26. [2022-04-28 04:07:39,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:39,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,533 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,533 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,535 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 04:07:39,535 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-28 04:07:39,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:39,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:39,535 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 04:07:39,535 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 35 states. [2022-04-28 04:07:39,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:39,537 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-04-28 04:07:39,537 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-04-28 04:07:39,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:39,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:39,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:39,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:39,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-04-28 04:07:39,538 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 23 [2022-04-28 04:07:39,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:39,539 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-04-28 04:07:39,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 9 states have internal predecessors, (20), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:39,539 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 28 transitions. [2022-04-28 04:07:39,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:39,575 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-04-28 04:07:39,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-04-28 04:07:39,576 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:39,576 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:39,576 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 04:07:39,576 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:39,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:39,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1490935601, now seen corresponding path program 5 times [2022-04-28 04:07:39,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:39,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715490143] [2022-04-28 04:07:39,725 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:39,855 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:39,906 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-28 04:07:39,996 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:39,996 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:39,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1694369359, now seen corresponding path program 1 times [2022-04-28 04:07:39,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:39,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467004636] [2022-04-28 04:07:39,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:39,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:40,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:40,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:40,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:40,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 04:07:40,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 04:07:40,030 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1503#true} {1503#true} #56#return; {1503#true} is VALID [2022-04-28 04:07:40,030 INFO L272 TraceCheckUtils]: 0: Hoare triple {1503#true} call ULTIMATE.init(); {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:40,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1509#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1503#true} is VALID [2022-04-28 04:07:40,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1503#true} assume true; {1503#true} is VALID [2022-04-28 04:07:40,031 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1503#true} {1503#true} #56#return; {1503#true} is VALID [2022-04-28 04:07:40,031 INFO L272 TraceCheckUtils]: 4: Hoare triple {1503#true} call #t~ret7 := main(); {1503#true} is VALID [2022-04-28 04:07:40,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1503#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1508#(= main_~a~0 0)} is VALID [2022-04-28 04:07:40,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1508#(= main_~a~0 0)} [72] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre6_133| |v_main_#t~pre6_128|) (= v_main_~c~0_179 v_main_~c~0_173) (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|) (= |v_main_#t~pre5_65| |v_main_#t~pre5_64|) (= v_main_~b~0_88 v_main_~b~0_86) (= v_main_~a~0_46 v_main_~a~0_45)) InVars {main_~c~0=v_main_~c~0_179, main_~b~0=v_main_~b~0_88, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_65|, main_~a~0=v_main_~a~0_46, main_#t~pre6=|v_main_#t~pre6_133|} OutVars{main_~c~0=v_main_~c~0_173, main_~b~0=v_main_~b~0_86, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_64|, main_~a~0=v_main_~a~0_45, main_#t~pre6=|v_main_#t~pre6_128|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1508#(= main_~a~0 0)} is VALID [2022-04-28 04:07:40,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1508#(= main_~a~0 0)} [71] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1504#false} is VALID [2022-04-28 04:07:40,033 INFO L290 TraceCheckUtils]: 8: Hoare triple {1504#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1504#false} is VALID [2022-04-28 04:07:40,033 INFO L290 TraceCheckUtils]: 9: Hoare triple {1504#false} assume !false; {1504#false} is VALID [2022-04-28 04:07:40,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:40,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:40,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467004636] [2022-04-28 04:07:40,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467004636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:40,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:40,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:40,184 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:40,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715490143] [2022-04-28 04:07:40,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715490143] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:40,184 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:40,184 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 04:07:40,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428251685] [2022-04-28 04:07:40,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:40,185 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 04:07:40,185 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:40,185 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:40,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 04:07:40,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:40,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 04:07:40,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:07:40,207 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:40,500 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 04:07:40,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 04:07:40,501 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-04-28 04:07:40,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 04:07:40,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 54 transitions. [2022-04-28 04:07:40,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 54 transitions. [2022-04-28 04:07:40,553 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-28 04:07:40,554 INFO L225 Difference]: With dead ends: 46 [2022-04-28 04:07:40,554 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 04:07:40,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:07:40,555 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 46 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:40,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 33 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:40,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 04:07:40,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-04-28 04:07:40,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:40,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,561 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,561 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:40,562 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 04:07:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 04:07:40,562 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:40,562 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:40,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:40,563 INFO L87 Difference]: Start difference. First operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:40,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:40,564 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-28 04:07:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2022-04-28 04:07:40,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:40,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:40,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:40,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:40,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-04-28 04:07:40,565 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 25 [2022-04-28 04:07:40,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:40,566 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-04-28 04:07:40,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 10 states have internal predecessors, (22), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:40,566 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 30 transitions. [2022-04-28 04:07:40,605 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-28 04:07:40,606 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-04-28 04:07:40,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-28 04:07:40,606 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:40,606 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:40,606 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-04-28 04:07:40,607 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:40,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:40,607 INFO L85 PathProgramCache]: Analyzing trace with hash -1028457137, now seen corresponding path program 6 times [2022-04-28 04:07:40,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:40,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1628123755] [2022-04-28 04:07:40,844 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:40,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:41,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:41,019 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:07:41,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:41,130 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1694430863, now seen corresponding path program 1 times [2022-04-28 04:07:41,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:41,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758729975] [2022-04-28 04:07:41,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:41,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:41,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:41,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:41,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1757#true} is VALID [2022-04-28 04:07:41,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-04-28 04:07:41,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1757#true} {1757#true} #56#return; {1757#true} is VALID [2022-04-28 04:07:41,159 INFO L272 TraceCheckUtils]: 0: Hoare triple {1757#true} call ULTIMATE.init(); {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:41,159 INFO L290 TraceCheckUtils]: 1: Hoare triple {1763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1757#true} is VALID [2022-04-28 04:07:41,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1757#true} assume true; {1757#true} is VALID [2022-04-28 04:07:41,160 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1757#true} {1757#true} #56#return; {1757#true} is VALID [2022-04-28 04:07:41,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {1757#true} call #t~ret7 := main(); {1757#true} is VALID [2022-04-28 04:07:41,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {1757#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {1762#(= main_~a~0 0)} is VALID [2022-04-28 04:07:41,161 INFO L290 TraceCheckUtils]: 6: Hoare triple {1762#(= main_~a~0 0)} [74] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_39| |v_main_#t~pre4_38|)) (.cse1 (= v_main_~b~0_98 v_main_~b~0_96)) (.cse2 (= v_main_~a~0_52 v_main_~a~0_51)) (.cse3 (= |v_main_#t~pre5_72| |v_main_#t~pre5_71|)) (.cse4 (= v_main_~c~0_217 v_main_~c~0_210))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_162| |v_main_#t~pre6_156|)) (and (= |v_main_#t~pre6_156| |v_main_#t~pre6_162|) .cse0 .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_217, main_~b~0=v_main_~b~0_98, main_#t~pre4=|v_main_#t~pre4_39|, main_#t~pre5=|v_main_#t~pre5_72|, main_~a~0=v_main_~a~0_52, main_#t~pre6=|v_main_#t~pre6_162|} OutVars{main_~c~0=v_main_~c~0_210, main_~b~0=v_main_~b~0_96, main_#t~pre4=|v_main_#t~pre4_38|, main_#t~pre5=|v_main_#t~pre5_71|, main_~a~0=v_main_~a~0_51, main_#t~pre6=|v_main_#t~pre6_156|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {1762#(= main_~a~0 0)} is VALID [2022-04-28 04:07:41,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {1762#(= main_~a~0 0)} [73] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1758#false} is VALID [2022-04-28 04:07:41,162 INFO L290 TraceCheckUtils]: 8: Hoare triple {1758#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {1758#false} is VALID [2022-04-28 04:07:41,162 INFO L290 TraceCheckUtils]: 9: Hoare triple {1758#false} assume !false; {1758#false} is VALID [2022-04-28 04:07:41,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:41,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:41,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758729975] [2022-04-28 04:07:41,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758729975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:41,162 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:41,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:41,309 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:41,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1628123755] [2022-04-28 04:07:41,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1628123755] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:41,309 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:41,309 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:07:41,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1434018694] [2022-04-28 04:07:41,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:41,310 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 04:07:41,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:41,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,331 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-28 04:07:41,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:07:41,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:41,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:07:41,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:07:41,332 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:41,791 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-04-28 04:07:41,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-28 04:07:41,792 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-04-28 04:07:41,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:41,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 04:07:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 54 transitions. [2022-04-28 04:07:41,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 54 transitions. [2022-04-28 04:07:41,849 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-28 04:07:41,850 INFO L225 Difference]: With dead ends: 46 [2022-04-28 04:07:41,850 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 04:07:41,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=111, Invalid=395, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:07:41,851 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 50 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:41,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 37 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:41,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 04:07:41,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2022-04-28 04:07:41,857 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:41,857 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,858 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,858 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:41,859 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-28 04:07:41,859 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 04:07:41,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:41,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:41,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:41,859 INFO L87 Difference]: Start difference. First operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 37 states. [2022-04-28 04:07:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:41,860 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-04-28 04:07:41,860 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-04-28 04:07:41,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:41,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:41,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:41,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:41,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-28 04:07:41,862 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-28 04:07:41,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:41,862 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-28 04:07:41,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 12 states have internal predecessors, (24), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:41,862 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 34 transitions. [2022-04-28 04:07:41,903 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-28 04:07:41,903 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-28 04:07:41,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 04:07:41,903 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:41,904 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:41,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-04-28 04:07:41,904 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:41,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:41,904 INFO L85 PathProgramCache]: Analyzing trace with hash -676441370, now seen corresponding path program 7 times [2022-04-28 04:07:41,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:41,905 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1270995675] [2022-04-28 04:07:42,144 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:42,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-28 04:07:42,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:42,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:42,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:42,555 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:07:42,591 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-28 04:07:42,670 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:42,671 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1694492367, now seen corresponding path program 1 times [2022-04-28 04:07:42,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:42,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482662111] [2022-04-28 04:07:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:42,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:42,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:42,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2025#true} is VALID [2022-04-28 04:07:42,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {2025#true} assume true; {2025#true} is VALID [2022-04-28 04:07:42,728 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2025#true} {2025#true} #56#return; {2025#true} is VALID [2022-04-28 04:07:42,729 INFO L272 TraceCheckUtils]: 0: Hoare triple {2025#true} call ULTIMATE.init(); {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:42,729 INFO L290 TraceCheckUtils]: 1: Hoare triple {2031#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2025#true} is VALID [2022-04-28 04:07:42,729 INFO L290 TraceCheckUtils]: 2: Hoare triple {2025#true} assume true; {2025#true} is VALID [2022-04-28 04:07:42,729 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2025#true} {2025#true} #56#return; {2025#true} is VALID [2022-04-28 04:07:42,729 INFO L272 TraceCheckUtils]: 4: Hoare triple {2025#true} call #t~ret7 := main(); {2025#true} is VALID [2022-04-28 04:07:42,730 INFO L290 TraceCheckUtils]: 5: Hoare triple {2025#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2030#(= main_~a~0 0)} is VALID [2022-04-28 04:07:42,730 INFO L290 TraceCheckUtils]: 6: Hoare triple {2030#(= main_~a~0 0)} [76] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_129 v_main_~b~0_126)) (.cse1 (= |v_main_#t~pre6_191| |v_main_#t~pre6_185|)) (.cse2 (= |v_main_#t~pre5_97| |v_main_#t~pre5_95|)) (.cse3 (= |v_main_#t~pre4_44| |v_main_#t~pre4_43|))) (or (and .cse0 .cse1 .cse2 (= v_main_~a~0_57 v_main_~a~0_58) .cse3 (= v_main_~c~0_267 v_main_~c~0_275)) (and .cse0 (= v_main_~c~0_275 v_main_~c~0_267) .cse1 .cse2 .cse3 (= v_main_~a~0_58 v_main_~a~0_57)))) InVars {main_~c~0=v_main_~c~0_275, main_~b~0=v_main_~b~0_129, main_#t~pre4=|v_main_#t~pre4_44|, main_#t~pre5=|v_main_#t~pre5_97|, main_~a~0=v_main_~a~0_58, main_#t~pre6=|v_main_#t~pre6_191|} OutVars{main_~c~0=v_main_~c~0_267, main_~b~0=v_main_~b~0_126, main_#t~pre4=|v_main_#t~pre4_43|, main_#t~pre5=|v_main_#t~pre5_95|, main_~a~0=v_main_~a~0_57, main_#t~pre6=|v_main_#t~pre6_185|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2030#(= main_~a~0 0)} is VALID [2022-04-28 04:07:42,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {2030#(= main_~a~0 0)} [75] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2026#false} is VALID [2022-04-28 04:07:42,734 INFO L290 TraceCheckUtils]: 8: Hoare triple {2026#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2026#false} is VALID [2022-04-28 04:07:42,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {2026#false} assume !false; {2026#false} is VALID [2022-04-28 04:07:42,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:42,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:42,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482662111] [2022-04-28 04:07:42,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482662111] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:42,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:42,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:42,921 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:42,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1270995675] [2022-04-28 04:07:42,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1270995675] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:42,921 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:42,921 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 04:07:42,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106898798] [2022-04-28 04:07:42,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 04:07:42,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:42,922 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:42,942 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-28 04:07:42,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 04:07:42,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:42,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 04:07:42,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-04-28 04:07:42,943 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:43,468 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-04-28 04:07:43,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 04:07:43,469 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-04-28 04:07:43,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:43,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-28 04:07:43,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 55 transitions. [2022-04-28 04:07:43,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 55 transitions. [2022-04-28 04:07:43,515 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-28 04:07:43,516 INFO L225 Difference]: With dead ends: 48 [2022-04-28 04:07:43,516 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 04:07:43,516 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 14 SyntacticMatches, 5 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=480, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:07:43,517 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:43,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:43,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 04:07:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2022-04-28 04:07:43,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:43,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,524 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,524 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:43,525 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 04:07:43,525 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 04:07:43,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:43,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:43,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 04:07:43,526 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 39 states. [2022-04-28 04:07:43,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:43,526 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-04-28 04:07:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2022-04-28 04:07:43,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:43,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:43,527 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:43,527 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:43,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2022-04-28 04:07:43,528 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 30 [2022-04-28 04:07:43,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:43,528 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2022-04-28 04:07:43,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.9285714285714286) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:43,528 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 35 transitions. [2022-04-28 04:07:43,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:43,567 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2022-04-28 04:07:43,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 04:07:43,568 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:43,568 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:43,568 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-04-28 04:07:43,568 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:43,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:43,568 INFO L85 PathProgramCache]: Analyzing trace with hash -818587708, now seen corresponding path program 8 times [2022-04-28 04:07:43,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:43,569 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [542398495] [2022-04-28 04:07:47,751 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:47,799 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:47,898 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:51,995 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:52,046 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:52,174 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:52,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-28 04:07:52,234 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:52,234 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:07:52,328 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:52,328 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:52,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1694553871, now seen corresponding path program 1 times [2022-04-28 04:07:52,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:52,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915621789] [2022-04-28 04:07:52,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:52,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:52,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:52,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:52,364 INFO L290 TraceCheckUtils]: 0: Hoare triple {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2306#true} is VALID [2022-04-28 04:07:52,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {2306#true} assume true; {2306#true} is VALID [2022-04-28 04:07:52,364 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2306#true} {2306#true} #56#return; {2306#true} is VALID [2022-04-28 04:07:52,367 INFO L272 TraceCheckUtils]: 0: Hoare triple {2306#true} call ULTIMATE.init(); {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:52,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2312#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2306#true} is VALID [2022-04-28 04:07:52,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {2306#true} assume true; {2306#true} is VALID [2022-04-28 04:07:52,367 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2306#true} {2306#true} #56#return; {2306#true} is VALID [2022-04-28 04:07:52,367 INFO L272 TraceCheckUtils]: 4: Hoare triple {2306#true} call #t~ret7 := main(); {2306#true} is VALID [2022-04-28 04:07:52,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {2306#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2311#(= main_~a~0 0)} is VALID [2022-04-28 04:07:52,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {2311#(= main_~a~0 0)} [78] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_123| |v_main_#t~pre5_121|) (= v_main_~b~0_162 v_main_~b~0_159) (= |v_main_#t~pre6_228| |v_main_#t~pre6_221|) (= |v_main_#t~pre4_49| |v_main_#t~pre4_48|) (= v_main_~a~0_64 v_main_~a~0_63) (= v_main_~c~0_339 v_main_~c~0_330)) InVars {main_~c~0=v_main_~c~0_339, main_~b~0=v_main_~b~0_162, main_#t~pre4=|v_main_#t~pre4_49|, main_#t~pre5=|v_main_#t~pre5_123|, main_~a~0=v_main_~a~0_64, main_#t~pre6=|v_main_#t~pre6_228|} OutVars{main_~c~0=v_main_~c~0_330, main_~b~0=v_main_~b~0_159, main_#t~pre4=|v_main_#t~pre4_48|, main_#t~pre5=|v_main_#t~pre5_121|, main_~a~0=v_main_~a~0_63, main_#t~pre6=|v_main_#t~pre6_221|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2311#(= main_~a~0 0)} is VALID [2022-04-28 04:07:52,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#(= main_~a~0 0)} [77] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2307#false} is VALID [2022-04-28 04:07:52,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {2307#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2307#false} is VALID [2022-04-28 04:07:52,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {2307#false} assume !false; {2307#false} is VALID [2022-04-28 04:07:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:52,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915621789] [2022-04-28 04:07:52,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915621789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:52,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:52,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:52,573 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:52,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [542398495] [2022-04-28 04:07:52,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [542398495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:52,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:52,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 04:07:52,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652058599] [2022-04-28 04:07:52,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:52,574 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 04:07:52,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:52,575 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:52,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:52,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 04:07:52,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:52,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 04:07:52,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:52,608 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:53,173 INFO L93 Difference]: Finished difference Result 50 states and 57 transitions. [2022-04-28 04:07:53,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 04:07:53,174 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-28 04:07:53,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:53,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-28 04:07:53,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 57 transitions. [2022-04-28 04:07:53,178 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 57 transitions. [2022-04-28 04:07:53,236 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:53,236 INFO L225 Difference]: With dead ends: 50 [2022-04-28 04:07:53,236 INFO L226 Difference]: Without dead ends: 41 [2022-04-28 04:07:53,237 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 15 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=573, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:07:53,237 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 55 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 248 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:53,238 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 17 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 248 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:53,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-28 04:07:53,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 35. [2022-04-28 04:07:53,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:53,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,245 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,245 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:53,246 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-28 04:07:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 04:07:53,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:53,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:53,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 04:07:53,247 INFO L87 Difference]: Start difference. First operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 41 states. [2022-04-28 04:07:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:53,248 INFO L93 Difference]: Finished difference Result 41 states and 45 transitions. [2022-04-28 04:07:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2022-04-28 04:07:53,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:53,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:53,249 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:53,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.096774193548387) internal successors, (34), 31 states have internal predecessors, (34), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 37 transitions. [2022-04-28 04:07:53,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 37 transitions. Word has length 32 [2022-04-28 04:07:53,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:53,250 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 37 transitions. [2022-04-28 04:07:53,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 1.9333333333333333) internal successors, (29), 14 states have internal predecessors, (29), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:53,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 37 transitions. [2022-04-28 04:07:53,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:53,303 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2022-04-28 04:07:53,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-28 04:07:53,303 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:53,303 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:53,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-04-28 04:07:53,304 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:53,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:53,304 INFO L85 PathProgramCache]: Analyzing trace with hash 17734946, now seen corresponding path program 9 times [2022-04-28 04:07:53,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:53,304 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1181702211] [2022-04-28 04:07:53,556 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:53,658 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:53,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:53,904 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:53,967 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-28 04:07:53,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:07:53,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:07:54,067 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:54,067 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:54,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1694615375, now seen corresponding path program 1 times [2022-04-28 04:07:54,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:54,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074455668] [2022-04-28 04:07:54,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:54,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:54,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:54,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2602#true} is VALID [2022-04-28 04:07:54,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {2602#true} assume true; {2602#true} is VALID [2022-04-28 04:07:54,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2602#true} {2602#true} #56#return; {2602#true} is VALID [2022-04-28 04:07:54,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {2602#true} call ULTIMATE.init(); {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:54,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {2608#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2602#true} is VALID [2022-04-28 04:07:54,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {2602#true} assume true; {2602#true} is VALID [2022-04-28 04:07:54,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2602#true} {2602#true} #56#return; {2602#true} is VALID [2022-04-28 04:07:54,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {2602#true} call #t~ret7 := main(); {2602#true} is VALID [2022-04-28 04:07:54,104 INFO L290 TraceCheckUtils]: 5: Hoare triple {2602#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2607#(= main_~a~0 0)} is VALID [2022-04-28 04:07:54,104 INFO L290 TraceCheckUtils]: 6: Hoare triple {2607#(= main_~a~0 0)} [80] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_54| |v_main_#t~pre4_53|)) (.cse1 (= |v_main_#t~pre5_149| |v_main_#t~pre5_147|)) (.cse2 (= v_main_~c~0_406 v_main_~c~0_396))) (or (and (= v_main_~a~0_69 v_main_~a~0_70) .cse0 (= |v_main_#t~pre6_259| |v_main_#t~pre6_267|) .cse1 .cse2 (= v_main_~b~0_192 v_main_~b~0_195)) (and (= v_main_~b~0_195 v_main_~b~0_192) .cse0 .cse1 .cse2 (= |v_main_#t~pre6_267| |v_main_#t~pre6_259|) (= v_main_~a~0_70 v_main_~a~0_69)))) InVars {main_~c~0=v_main_~c~0_406, main_~b~0=v_main_~b~0_195, main_#t~pre4=|v_main_#t~pre4_54|, main_#t~pre5=|v_main_#t~pre5_149|, main_~a~0=v_main_~a~0_70, main_#t~pre6=|v_main_#t~pre6_267|} OutVars{main_~c~0=v_main_~c~0_396, main_~b~0=v_main_~b~0_192, main_#t~pre4=|v_main_#t~pre4_53|, main_#t~pre5=|v_main_#t~pre5_147|, main_~a~0=v_main_~a~0_69, main_#t~pre6=|v_main_#t~pre6_259|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2607#(= main_~a~0 0)} is VALID [2022-04-28 04:07:54,105 INFO L290 TraceCheckUtils]: 7: Hoare triple {2607#(= main_~a~0 0)} [79] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2603#false} is VALID [2022-04-28 04:07:54,105 INFO L290 TraceCheckUtils]: 8: Hoare triple {2603#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2603#false} is VALID [2022-04-28 04:07:54,105 INFO L290 TraceCheckUtils]: 9: Hoare triple {2603#false} assume !false; {2603#false} is VALID [2022-04-28 04:07:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:54,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:54,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074455668] [2022-04-28 04:07:54,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074455668] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:54,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:54,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:54,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:54,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1181702211] [2022-04-28 04:07:54,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1181702211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:54,311 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:54,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 04:07:54,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041639909] [2022-04-28 04:07:54,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:54,312 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 04:07:54,312 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:54,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,345 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-28 04:07:54,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 04:07:54,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:54,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 04:07:54,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=192, Unknown=0, NotChecked=0, Total=240 [2022-04-28 04:07:54,346 INFO L87 Difference]: Start difference. First operand 35 states and 37 transitions. Second operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:54,886 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-04-28 04:07:54,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 04:07:54,886 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-04-28 04:07:54,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-28 04:07:54,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 59 transitions. [2022-04-28 04:07:54,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 59 transitions. [2022-04-28 04:07:54,950 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-28 04:07:54,951 INFO L225 Difference]: With dead ends: 52 [2022-04-28 04:07:54,951 INFO L226 Difference]: Without dead ends: 43 [2022-04-28 04:07:54,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=674, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:07:54,952 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 57 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:54,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:54,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-04-28 04:07:54,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 37. [2022-04-28 04:07:54,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:54,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,963 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,963 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:54,964 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 04:07:54,964 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 04:07:54,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:54,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:54,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 04:07:54,966 INFO L87 Difference]: Start difference. First operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 43 states. [2022-04-28 04:07:54,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:54,967 INFO L93 Difference]: Finished difference Result 43 states and 47 transitions. [2022-04-28 04:07:54,967 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2022-04-28 04:07:54,967 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:54,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:54,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:54,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:54,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 33 states have internal predecessors, (36), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2022-04-28 04:07:54,968 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 34 [2022-04-28 04:07:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:54,969 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2022-04-28 04:07:54,973 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:54,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 39 transitions. [2022-04-28 04:07:55,022 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-28 04:07:55,022 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2022-04-28 04:07:55,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-28 04:07:55,022 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:55,022 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:55,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-04-28 04:07:55,023 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:55,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:55,024 INFO L85 PathProgramCache]: Analyzing trace with hash 564921088, now seen corresponding path program 10 times [2022-04-28 04:07:55,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:55,024 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245234711] [2022-04-28 04:07:59,266 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:59,320 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:59,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-28 04:08:03,515 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:03,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-28 04:08:03,698 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:03,763 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-28 04:08:03,772 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:03,773 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:03,864 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:03,864 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:03,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1694676879, now seen corresponding path program 1 times [2022-04-28 04:08:03,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:03,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914771625] [2022-04-28 04:08:03,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:03,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:03,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:03,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:03,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2913#true} is VALID [2022-04-28 04:08:03,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {2913#true} assume true; {2913#true} is VALID [2022-04-28 04:08:03,900 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2913#true} {2913#true} #56#return; {2913#true} is VALID [2022-04-28 04:08:03,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {2913#true} call ULTIMATE.init(); {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:03,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {2919#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {2913#true} is VALID [2022-04-28 04:08:03,901 INFO L290 TraceCheckUtils]: 2: Hoare triple {2913#true} assume true; {2913#true} is VALID [2022-04-28 04:08:03,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2913#true} {2913#true} #56#return; {2913#true} is VALID [2022-04-28 04:08:03,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {2913#true} call #t~ret7 := main(); {2913#true} is VALID [2022-04-28 04:08:03,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {2913#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {2918#(= main_~a~0 0)} is VALID [2022-04-28 04:08:03,902 INFO L290 TraceCheckUtils]: 6: Hoare triple {2918#(= main_~a~0 0)} [82] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_76 v_main_~a~0_75)) (.cse1 (= v_main_~b~0_228 v_main_~b~0_225)) (.cse2 (= |v_main_#t~pre4_59| |v_main_#t~pre4_58|)) (.cse3 (= |v_main_#t~pre5_175| |v_main_#t~pre5_173|)) (.cse4 (= |v_main_#t~pre6_308| |v_main_#t~pre6_299|))) (or (and (= v_main_~c~0_465 v_main_~c~0_476) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 .cse1 (= v_main_~c~0_476 v_main_~c~0_465) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_476, main_~b~0=v_main_~b~0_228, main_#t~pre4=|v_main_#t~pre4_59|, main_#t~pre5=|v_main_#t~pre5_175|, main_~a~0=v_main_~a~0_76, main_#t~pre6=|v_main_#t~pre6_308|} OutVars{main_~c~0=v_main_~c~0_465, main_~b~0=v_main_~b~0_225, main_#t~pre4=|v_main_#t~pre4_58|, main_#t~pre5=|v_main_#t~pre5_173|, main_~a~0=v_main_~a~0_75, main_#t~pre6=|v_main_#t~pre6_299|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {2918#(= main_~a~0 0)} is VALID [2022-04-28 04:08:03,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {2918#(= main_~a~0 0)} [81] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {2914#false} is VALID [2022-04-28 04:08:03,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {2914#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {2914#false} is VALID [2022-04-28 04:08:03,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {2914#false} assume !false; {2914#false} is VALID [2022-04-28 04:08:03,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:03,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:03,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914771625] [2022-04-28 04:08:03,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914771625] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:03,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:03,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:04,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:04,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245234711] [2022-04-28 04:08:04,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245234711] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:04,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:04,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 04:08:04,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863526518] [2022-04-28 04:08:04,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:04,128 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 04:08:04,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:04,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:04,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 04:08:04,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:04,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 04:08:04,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=221, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:08:04,158 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:04,803 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2022-04-28 04:08:04,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-28 04:08:04,803 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-04-28 04:08:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:04,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2022-04-28 04:08:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 61 transitions. [2022-04-28 04:08:04,805 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 61 transitions. [2022-04-28 04:08:04,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:04,864 INFO L225 Difference]: With dead ends: 54 [2022-04-28 04:08:04,864 INFO L226 Difference]: Without dead ends: 45 [2022-04-28 04:08:04,865 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=783, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:08:04,865 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:04,866 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 22 Invalid, 342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:08:04,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-28 04:08:04,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-04-28 04:08:04,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:04,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,872 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,872 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:04,873 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 04:08:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 04:08:04,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:04,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:04,874 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 04:08:04,874 INFO L87 Difference]: Start difference. First operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 45 states. [2022-04-28 04:08:04,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:04,875 INFO L93 Difference]: Finished difference Result 45 states and 49 transitions. [2022-04-28 04:08:04,875 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 49 transitions. [2022-04-28 04:08:04,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:04,875 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:04,875 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:04,875 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 35 states have (on average 1.0857142857142856) internal successors, (38), 35 states have internal predecessors, (38), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 41 transitions. [2022-04-28 04:08:04,876 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 41 transitions. Word has length 36 [2022-04-28 04:08:04,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:04,876 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 41 transitions. [2022-04-28 04:08:04,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.9411764705882353) internal successors, (33), 16 states have internal predecessors, (33), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:04,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 41 transitions. [2022-04-28 04:08:04,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:04,933 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 41 transitions. [2022-04-28 04:08:04,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 04:08:04,934 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:04,934 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:04,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-04-28 04:08:04,934 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:04,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1870173858, now seen corresponding path program 11 times [2022-04-28 04:08:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:04,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [166344322] [2022-04-28 04:08:05,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-28 04:08:05,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:05,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-28 04:08:05,532 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:05,590 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-28 04:08:05,597 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:05,598 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:05,697 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:05,697 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:05,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1694738383, now seen corresponding path program 1 times [2022-04-28 04:08:05,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:05,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352747949] [2022-04-28 04:08:05,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:05,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:05,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:05,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:05,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3239#true} is VALID [2022-04-28 04:08:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-28 04:08:05,743 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3239#true} {3239#true} #56#return; {3239#true} is VALID [2022-04-28 04:08:05,743 INFO L272 TraceCheckUtils]: 0: Hoare triple {3239#true} call ULTIMATE.init(); {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:05,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {3245#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3239#true} is VALID [2022-04-28 04:08:05,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {3239#true} assume true; {3239#true} is VALID [2022-04-28 04:08:05,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3239#true} {3239#true} #56#return; {3239#true} is VALID [2022-04-28 04:08:05,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {3239#true} call #t~ret7 := main(); {3239#true} is VALID [2022-04-28 04:08:05,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {3239#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3244#(= main_~a~0 0)} is VALID [2022-04-28 04:08:05,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {3244#(= main_~a~0 0)} [84] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_549 v_main_~c~0_537) (= v_main_~a~0_82 v_main_~a~0_81) (= |v_main_#t~pre5_201| |v_main_#t~pre5_199|) (= |v_main_#t~pre4_64| |v_main_#t~pre4_63|) (= |v_main_#t~pre6_351| |v_main_#t~pre6_341|) (= v_main_~b~0_261 v_main_~b~0_258)) InVars {main_~c~0=v_main_~c~0_549, main_~b~0=v_main_~b~0_261, main_#t~pre4=|v_main_#t~pre4_64|, main_#t~pre5=|v_main_#t~pre5_201|, main_~a~0=v_main_~a~0_82, main_#t~pre6=|v_main_#t~pre6_351|} OutVars{main_~c~0=v_main_~c~0_537, main_~b~0=v_main_~b~0_258, main_#t~pre4=|v_main_#t~pre4_63|, main_#t~pre5=|v_main_#t~pre5_199|, main_~a~0=v_main_~a~0_81, main_#t~pre6=|v_main_#t~pre6_341|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3244#(= main_~a~0 0)} is VALID [2022-04-28 04:08:05,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {3244#(= main_~a~0 0)} [83] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {3240#false} is VALID [2022-04-28 04:08:05,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {3240#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3240#false} is VALID [2022-04-28 04:08:05,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {3240#false} assume !false; {3240#false} is VALID [2022-04-28 04:08:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:05,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352747949] [2022-04-28 04:08:05,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352747949] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:05,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:05,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:06,016 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:06,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [166344322] [2022-04-28 04:08:06,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [166344322] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:06,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:06,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 04:08:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927443247] [2022-04-28 04:08:06,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:06,017 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 04:08:06,017 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:06,017 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:06,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 04:08:06,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:06,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 04:08:06,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-28 04:08:06,045 INFO L87 Difference]: Start difference. First operand 39 states and 41 transitions. Second operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:06,864 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-04-28 04:08:06,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 04:08:06,864 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 38 [2022-04-28 04:08:06,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-28 04:08:06,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 63 transitions. [2022-04-28 04:08:06,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 63 transitions. [2022-04-28 04:08:06,924 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:06,925 INFO L225 Difference]: With dead ends: 56 [2022-04-28 04:08:06,925 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 04:08:06,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 17 SyntacticMatches, 6 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=156, Invalid=900, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:08:06,926 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 52 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:06,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 67 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:08:06,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 04:08:06,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2022-04-28 04:08:06,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:06,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,936 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,936 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:06,937 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 04:08:06,937 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 04:08:06,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:06,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:06,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 04:08:06,937 INFO L87 Difference]: Start difference. First operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 47 states. [2022-04-28 04:08:06,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:06,938 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 04:08:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 04:08:06,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:06,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:06,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:06,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:06,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 37 states have internal predecessors, (40), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2022-04-28 04:08:06,945 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 38 [2022-04-28 04:08:06,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:06,945 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2022-04-28 04:08:06,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.9444444444444444) internal successors, (35), 17 states have internal predecessors, (35), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:06,946 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 43 transitions. [2022-04-28 04:08:07,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:07,008 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2022-04-28 04:08:07,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-28 04:08:07,009 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:07,009 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:07,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-04-28 04:08:07,009 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:07,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:07,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1239240644, now seen corresponding path program 12 times [2022-04-28 04:08:07,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:07,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [113710222] [2022-04-28 04:08:07,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:07,405 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:07,529 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:07,620 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:07,668 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-28 04:08:07,675 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:07,675 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:07,770 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:07,770 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:07,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1694799887, now seen corresponding path program 1 times [2022-04-28 04:08:07,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:07,771 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725521317] [2022-04-28 04:08:07,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:07,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:07,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:07,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:07,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3580#true} is VALID [2022-04-28 04:08:07,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-28 04:08:07,802 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3580#true} {3580#true} #56#return; {3580#true} is VALID [2022-04-28 04:08:07,802 INFO L272 TraceCheckUtils]: 0: Hoare triple {3580#true} call ULTIMATE.init(); {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:07,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {3586#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3580#true} is VALID [2022-04-28 04:08:07,802 INFO L290 TraceCheckUtils]: 2: Hoare triple {3580#true} assume true; {3580#true} is VALID [2022-04-28 04:08:07,802 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3580#true} {3580#true} #56#return; {3580#true} is VALID [2022-04-28 04:08:07,803 INFO L272 TraceCheckUtils]: 4: Hoare triple {3580#true} call #t~ret7 := main(); {3580#true} is VALID [2022-04-28 04:08:07,803 INFO L290 TraceCheckUtils]: 5: Hoare triple {3580#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3585#(= main_~a~0 0)} is VALID [2022-04-28 04:08:07,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {3585#(= main_~a~0 0)} [86] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_88 v_main_~a~0_87)) (.cse1 (= |v_main_#t~pre6_396| |v_main_#t~pre6_385|)) (.cse2 (= v_main_~c~0_625 v_main_~c~0_612)) (.cse3 (= |v_main_#t~pre4_69| |v_main_#t~pre4_68|)) (.cse4 (= |v_main_#t~pre5_227| |v_main_#t~pre5_225|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_291 v_main_~b~0_294)) (and .cse0 .cse1 (= v_main_~b~0_294 v_main_~b~0_291) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_625, main_~b~0=v_main_~b~0_294, main_#t~pre4=|v_main_#t~pre4_69|, main_#t~pre5=|v_main_#t~pre5_227|, main_~a~0=v_main_~a~0_88, main_#t~pre6=|v_main_#t~pre6_396|} OutVars{main_~c~0=v_main_~c~0_612, main_~b~0=v_main_~b~0_291, main_#t~pre4=|v_main_#t~pre4_68|, main_#t~pre5=|v_main_#t~pre5_225|, main_~a~0=v_main_~a~0_87, main_#t~pre6=|v_main_#t~pre6_385|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3585#(= main_~a~0 0)} is VALID [2022-04-28 04:08:07,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {3585#(= main_~a~0 0)} [85] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {3581#false} is VALID [2022-04-28 04:08:07,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {3581#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3581#false} is VALID [2022-04-28 04:08:07,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {3581#false} assume !false; {3581#false} is VALID [2022-04-28 04:08:07,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:07,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:07,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725521317] [2022-04-28 04:08:07,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725521317] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:07,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:07,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:08,109 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:08,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [113710222] [2022-04-28 04:08:08,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [113710222] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:08,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:08,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 04:08:08,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92221754] [2022-04-28 04:08:08,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:08,110 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 04:08:08,111 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:08,111 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:08,138 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-28 04:08:08,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 04:08:08,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:08,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 04:08:08,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-04-28 04:08:08,139 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:09,025 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2022-04-28 04:08:09,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-28 04:08:09,026 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 40 [2022-04-28 04:08:09,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2022-04-28 04:08:09,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 68 transitions. [2022-04-28 04:08:09,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 68 transitions. [2022-04-28 04:08:09,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:09,078 INFO L225 Difference]: With dead ends: 60 [2022-04-28 04:08:09,078 INFO L226 Difference]: Without dead ends: 51 [2022-04-28 04:08:09,079 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=165, Invalid=1025, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:08:09,080 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 66 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:09,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 27 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:08:09,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-28 04:08:09,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 45. [2022-04-28 04:08:09,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:09,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,091 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,091 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:09,092 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 04:08:09,092 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 04:08:09,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:09,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:09,093 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 04:08:09,093 INFO L87 Difference]: Start difference. First operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 51 states. [2022-04-28 04:08:09,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:09,094 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-04-28 04:08:09,094 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-04-28 04:08:09,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:09,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:09,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:09,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:09,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2022-04-28 04:08:09,095 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 40 [2022-04-28 04:08:09,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:09,095 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2022-04-28 04:08:09,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 18 states have internal predecessors, (37), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:09,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 47 transitions. [2022-04-28 04:08:09,154 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:09,154 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2022-04-28 04:08:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-28 04:08:09,154 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:09,154 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:09,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-04-28 04:08:09,155 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:09,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:09,155 INFO L85 PathProgramCache]: Analyzing trace with hash -502810726, now seen corresponding path program 13 times [2022-04-28 04:08:09,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:09,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1599794983] [2022-04-28 04:08:11,904 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:11,959 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:12,056 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:15,886 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:15,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:16,040 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:16,188 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-28 04:08:16,310 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:16,311 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:16,312 INFO L85 PathProgramCache]: Analyzing trace with hash 1694861391, now seen corresponding path program 1 times [2022-04-28 04:08:16,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:16,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598349313] [2022-04-28 04:08:16,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:16,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:16,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:16,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:16,339 INFO L290 TraceCheckUtils]: 0: Hoare triple {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3948#true} is VALID [2022-04-28 04:08:16,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-04-28 04:08:16,340 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3948#true} {3948#true} #56#return; {3948#true} is VALID [2022-04-28 04:08:16,340 INFO L272 TraceCheckUtils]: 0: Hoare triple {3948#true} call ULTIMATE.init(); {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:16,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {3954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {3948#true} is VALID [2022-04-28 04:08:16,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {3948#true} assume true; {3948#true} is VALID [2022-04-28 04:08:16,340 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3948#true} {3948#true} #56#return; {3948#true} is VALID [2022-04-28 04:08:16,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {3948#true} call #t~ret7 := main(); {3948#true} is VALID [2022-04-28 04:08:16,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {3948#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {3953#(= main_~a~0 0)} is VALID [2022-04-28 04:08:16,341 INFO L290 TraceCheckUtils]: 6: Hoare triple {3953#(= main_~a~0 0)} [88] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_94 v_main_~a~0_93)) (.cse1 (= |v_main_#t~pre5_251| |v_main_#t~pre5_249|)) (.cse2 (= |v_main_#t~pre4_74| |v_main_#t~pre4_73|)) (.cse3 (= |v_main_#t~pre6_436| |v_main_#t~pre6_424|)) (.cse4 (= v_main_~b~0_323 v_main_~b~0_320))) (or (and (= v_main_~c~0_696 v_main_~c~0_682) .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse0 (= v_main_~c~0_682 v_main_~c~0_696) .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_696, main_~b~0=v_main_~b~0_323, main_#t~pre4=|v_main_#t~pre4_74|, main_#t~pre5=|v_main_#t~pre5_251|, main_~a~0=v_main_~a~0_94, main_#t~pre6=|v_main_#t~pre6_436|} OutVars{main_~c~0=v_main_~c~0_682, main_~b~0=v_main_~b~0_320, main_#t~pre4=|v_main_#t~pre4_73|, main_#t~pre5=|v_main_#t~pre5_249|, main_~a~0=v_main_~a~0_93, main_#t~pre6=|v_main_#t~pre6_424|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {3953#(= main_~a~0 0)} is VALID [2022-04-28 04:08:16,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {3953#(= main_~a~0 0)} [87] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {3949#false} is VALID [2022-04-28 04:08:16,342 INFO L290 TraceCheckUtils]: 8: Hoare triple {3949#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {3949#false} is VALID [2022-04-28 04:08:16,342 INFO L290 TraceCheckUtils]: 9: Hoare triple {3949#false} assume !false; {3949#false} is VALID [2022-04-28 04:08:16,342 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:16,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:16,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598349313] [2022-04-28 04:08:16,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598349313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:16,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:16,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:16,657 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:16,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1599794983] [2022-04-28 04:08:16,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1599794983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:16,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:16,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 04:08:16,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916510967] [2022-04-28 04:08:16,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:16,658 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 04:08:16,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:16,658 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:16,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:16,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 04:08:16,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:16,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 04:08:16,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=320, Unknown=0, NotChecked=0, Total=380 [2022-04-28 04:08:16,688 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,521 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-28 04:08:17,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 04:08:17,521 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 42 [2022-04-28 04:08:17,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-28 04:08:17,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 68 transitions. [2022-04-28 04:08:17,525 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 68 transitions. [2022-04-28 04:08:17,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:17,582 INFO L225 Difference]: With dead ends: 61 [2022-04-28 04:08:17,582 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 04:08:17,583 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 18 SyntacticMatches, 7 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=174, Invalid=1158, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:08:17,583 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 56 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:17,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 47 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 04:08:17,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 04:08:17,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 47. [2022-04-28 04:08:17,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:17,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,594 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,594 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,595 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 04:08:17,595 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 04:08:17,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:17,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:17,595 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 04:08:17,595 INFO L87 Difference]: Start difference. First operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 52 states. [2022-04-28 04:08:17,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:17,596 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 04:08:17,596 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-28 04:08:17,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:17,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:17,596 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:17,596 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:17,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 43 states have (on average 1.069767441860465) internal successors, (46), 43 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 49 transitions. [2022-04-28 04:08:17,597 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 49 transitions. Word has length 42 [2022-04-28 04:08:17,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:17,597 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 49 transitions. [2022-04-28 04:08:17,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.95) internal successors, (39), 19 states have internal predecessors, (39), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:17,597 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 49 transitions. [2022-04-28 04:08:17,655 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-28 04:08:17,656 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 49 transitions. [2022-04-28 04:08:17,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-28 04:08:17,656 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:17,656 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:17,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-04-28 04:08:17,656 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:17,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:17,657 INFO L85 PathProgramCache]: Analyzing trace with hash -594972485, now seen corresponding path program 14 times [2022-04-28 04:08:17,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:17,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1203482300] [2022-04-28 04:08:17,866 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:17,968 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:18,081 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:18,185 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:18,369 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-28 04:08:18,423 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-28 04:08:18,521 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:18,521 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:18,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1694922895, now seen corresponding path program 1 times [2022-04-28 04:08:18,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:18,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514522349] [2022-04-28 04:08:18,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:18,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:18,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:18,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:18,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:18,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4327#true} is VALID [2022-04-28 04:08:18,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {4327#true} assume true; {4327#true} is VALID [2022-04-28 04:08:18,555 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4327#true} {4327#true} #56#return; {4327#true} is VALID [2022-04-28 04:08:18,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {4327#true} call ULTIMATE.init(); {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {4333#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4327#true} is VALID [2022-04-28 04:08:18,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {4327#true} assume true; {4327#true} is VALID [2022-04-28 04:08:18,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4327#true} {4327#true} #56#return; {4327#true} is VALID [2022-04-28 04:08:18,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {4327#true} call #t~ret7 := main(); {4327#true} is VALID [2022-04-28 04:08:18,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {4327#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4332#(= main_~a~0 0)} is VALID [2022-04-28 04:08:18,556 INFO L290 TraceCheckUtils]: 6: Hoare triple {4332#(= main_~a~0 0)} [90] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_476| |v_main_#t~pre6_464|)) (.cse1 (= v_main_~b~0_361 v_main_~b~0_357)) (.cse2 (= v_main_~a~0_100 v_main_~a~0_99))) (or (and .cse0 .cse1 (= v_main_~c~0_775 v_main_~c~0_760) .cse2 (= |v_main_#t~pre4_79| |v_main_#t~pre4_78|) (= |v_main_#t~pre5_282| |v_main_#t~pre5_279|)) (and (= v_main_~c~0_760 v_main_~c~0_775) .cse0 .cse1 (= |v_main_#t~pre4_78| |v_main_#t~pre4_79|) (= |v_main_#t~pre5_279| |v_main_#t~pre5_282|) .cse2))) InVars {main_~c~0=v_main_~c~0_775, main_~b~0=v_main_~b~0_361, main_#t~pre4=|v_main_#t~pre4_79|, main_#t~pre5=|v_main_#t~pre5_282|, main_~a~0=v_main_~a~0_100, main_#t~pre6=|v_main_#t~pre6_476|} OutVars{main_~c~0=v_main_~c~0_760, main_~b~0=v_main_~b~0_357, main_#t~pre4=|v_main_#t~pre4_78|, main_#t~pre5=|v_main_#t~pre5_279|, main_~a~0=v_main_~a~0_99, main_#t~pre6=|v_main_#t~pre6_464|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4332#(= main_~a~0 0)} is VALID [2022-04-28 04:08:18,557 INFO L290 TraceCheckUtils]: 7: Hoare triple {4332#(= main_~a~0 0)} [89] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {4328#false} is VALID [2022-04-28 04:08:18,557 INFO L290 TraceCheckUtils]: 8: Hoare triple {4328#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4328#false} is VALID [2022-04-28 04:08:18,557 INFO L290 TraceCheckUtils]: 9: Hoare triple {4328#false} assume !false; {4328#false} is VALID [2022-04-28 04:08:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:18,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514522349] [2022-04-28 04:08:18,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514522349] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:18,557 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:18,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:18,901 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:18,901 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1203482300] [2022-04-28 04:08:18,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1203482300] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:18,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:18,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 04:08:18,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336745270] [2022-04-28 04:08:18,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:18,902 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 04:08:18,902 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:18,902 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:18,932 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-28 04:08:18,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 04:08:18,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:18,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 04:08:18,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=357, Unknown=0, NotChecked=0, Total=420 [2022-04-28 04:08:18,933 INFO L87 Difference]: Start difference. First operand 47 states and 49 transitions. Second operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:19,879 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-04-28 04:08:19,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-28 04:08:19,880 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 45 [2022-04-28 04:08:19,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:19,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-28 04:08:19,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 70 transitions. [2022-04-28 04:08:19,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 70 transitions. [2022-04-28 04:08:19,933 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-28 04:08:19,933 INFO L225 Difference]: With dead ends: 63 [2022-04-28 04:08:19,933 INFO L226 Difference]: Without dead ends: 54 [2022-04-28 04:08:19,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 19 SyntacticMatches, 8 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=183, Invalid=1299, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:08:19,934 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 59 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:19,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 47 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 04:08:19,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-04-28 04:08:19,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2022-04-28 04:08:19,946 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:19,946 INFO L82 GeneralOperation]: Start isEquivalent. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,946 INFO L74 IsIncluded]: Start isIncluded. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,946 INFO L87 Difference]: Start difference. First operand 54 states. Second operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:19,947 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 04:08:19,947 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 04:08:19,948 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:19,948 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:19,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 04:08:19,948 INFO L87 Difference]: Start difference. First operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 54 states. [2022-04-28 04:08:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:19,949 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2022-04-28 04:08:19,949 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-28 04:08:19,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:19,949 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:19,949 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:19,949 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:19,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 44 states have (on average 1.0681818181818181) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2022-04-28 04:08:19,950 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 45 [2022-04-28 04:08:19,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:19,951 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2022-04-28 04:08:19,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.0) internal successors, (42), 20 states have internal predecessors, (42), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:19,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 50 transitions. [2022-04-28 04:08:20,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2022-04-28 04:08:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-28 04:08:20,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:20,012 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:20,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-04-28 04:08:20,012 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:20,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:20,013 INFO L85 PathProgramCache]: Analyzing trace with hash 163599449, now seen corresponding path program 15 times [2022-04-28 04:08:20,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:20,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1734553719] [2022-04-28 04:08:22,680 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:22,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-28 04:08:22,821 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:26,912 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:26,963 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,052 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,100 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-28 04:08:27,107 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:27,108 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:27,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:27,195 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:27,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1694984399, now seen corresponding path program 1 times [2022-04-28 04:08:27,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:27,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134754654] [2022-04-28 04:08:27,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:27,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:27,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:27,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:27,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:27,222 INFO L290 TraceCheckUtils]: 0: Hoare triple {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4719#true} is VALID [2022-04-28 04:08:27,222 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 04:08:27,222 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4719#true} {4719#true} #56#return; {4719#true} is VALID [2022-04-28 04:08:27,222 INFO L272 TraceCheckUtils]: 0: Hoare triple {4719#true} call ULTIMATE.init(); {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:27,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {4725#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {4719#true} is VALID [2022-04-28 04:08:27,223 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume true; {4719#true} is VALID [2022-04-28 04:08:27,223 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4719#true} {4719#true} #56#return; {4719#true} is VALID [2022-04-28 04:08:27,223 INFO L272 TraceCheckUtils]: 4: Hoare triple {4719#true} call #t~ret7 := main(); {4719#true} is VALID [2022-04-28 04:08:27,231 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {4724#(= main_~a~0 0)} is VALID [2022-04-28 04:08:27,232 INFO L290 TraceCheckUtils]: 6: Hoare triple {4724#(= main_~a~0 0)} [92] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_853 v_main_~c~0_837) (= v_main_~a~0_106 v_main_~a~0_105) (= |v_main_#t~pre6_519| |v_main_#t~pre6_506|) (= v_main_~b~0_396 v_main_~b~0_392) (= |v_main_#t~pre5_309| |v_main_#t~pre5_306|) (= |v_main_#t~pre4_84| |v_main_#t~pre4_83|)) InVars {main_~c~0=v_main_~c~0_853, main_~b~0=v_main_~b~0_396, main_#t~pre4=|v_main_#t~pre4_84|, main_#t~pre5=|v_main_#t~pre5_309|, main_~a~0=v_main_~a~0_106, main_#t~pre6=|v_main_#t~pre6_519|} OutVars{main_~c~0=v_main_~c~0_837, main_~b~0=v_main_~b~0_392, main_#t~pre4=|v_main_#t~pre4_83|, main_#t~pre5=|v_main_#t~pre5_306|, main_~a~0=v_main_~a~0_105, main_#t~pre6=|v_main_#t~pre6_506|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {4724#(= main_~a~0 0)} is VALID [2022-04-28 04:08:27,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {4724#(= main_~a~0 0)} [91] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {4720#false} is VALID [2022-04-28 04:08:27,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {4720#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {4720#false} is VALID [2022-04-28 04:08:27,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-04-28 04:08:27,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:27,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:27,234 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134754654] [2022-04-28 04:08:27,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134754654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:27,234 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:27,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:27,572 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:27,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1734553719] [2022-04-28 04:08:27,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1734553719] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:27,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:27,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 04:08:27,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211469148] [2022-04-28 04:08:27,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:27,573 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 04:08:27,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:27,573 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:27,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:27,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 04:08:27,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:27,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 04:08:27,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=396, Unknown=0, NotChecked=0, Total=462 [2022-04-28 04:08:27,607 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:28,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:28,951 INFO L93 Difference]: Finished difference Result 65 states and 72 transitions. [2022-04-28 04:08:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 04:08:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 47 [2022-04-28 04:08:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:28,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:28,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-04-28 04:08:28,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:28,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 72 transitions. [2022-04-28 04:08:28,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 72 transitions. [2022-04-28 04:08:29,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:29,013 INFO L225 Difference]: With dead ends: 65 [2022-04-28 04:08:29,013 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 04:08:29,014 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 20 SyntacticMatches, 8 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 328 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=192, Invalid=1448, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:08:29,014 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 60 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 795 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:29,015 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 107 Invalid, 795 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:08:29,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 04:08:29,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2022-04-28 04:08:29,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:29,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,027 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,027 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:29,027 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-28 04:08:29,028 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 04:08:29,028 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:29,028 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:29,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 04:08:29,028 INFO L87 Difference]: Start difference. First operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 56 states. [2022-04-28 04:08:29,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:29,029 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2022-04-28 04:08:29,029 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-28 04:08:29,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:29,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:29,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:29,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 46 states have (on average 1.065217391304348) internal successors, (49), 46 states have internal predecessors, (49), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2022-04-28 04:08:29,030 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 47 [2022-04-28 04:08:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:29,030 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2022-04-28 04:08:29,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.0) internal successors, (44), 21 states have internal predecessors, (44), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:29,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 52 transitions. [2022-04-28 04:08:29,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:29,094 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2022-04-28 04:08:29,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-28 04:08:29,095 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:29,095 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:29,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-04-28 04:08:29,095 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:29,095 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:29,095 INFO L85 PathProgramCache]: Analyzing trace with hash -993212297, now seen corresponding path program 16 times [2022-04-28 04:08:29,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:29,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687426777] [2022-04-28 04:08:29,325 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,411 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,527 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,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-28 04:08:29,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-28 04:08:29,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:29,679 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:29,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:29,784 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:29,785 INFO L85 PathProgramCache]: Analyzing trace with hash 1695045903, now seen corresponding path program 1 times [2022-04-28 04:08:29,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:29,785 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522338543] [2022-04-28 04:08:29,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:29,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:29,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:29,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:29,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:29,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5126#true} is VALID [2022-04-28 04:08:29,827 INFO L290 TraceCheckUtils]: 1: Hoare triple {5126#true} assume true; {5126#true} is VALID [2022-04-28 04:08:29,827 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5126#true} {5126#true} #56#return; {5126#true} is VALID [2022-04-28 04:08:29,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {5126#true} call ULTIMATE.init(); {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:29,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {5132#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5126#true} is VALID [2022-04-28 04:08:29,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {5126#true} assume true; {5126#true} is VALID [2022-04-28 04:08:29,828 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5126#true} {5126#true} #56#return; {5126#true} is VALID [2022-04-28 04:08:29,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {5126#true} call #t~ret7 := main(); {5126#true} is VALID [2022-04-28 04:08:29,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {5126#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5131#(= main_~a~0 0)} is VALID [2022-04-28 04:08:29,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {5131#(= main_~a~0 0)} [94] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_112 v_main_~a~0_111)) (.cse1 (= v_main_~c~0_934 v_main_~c~0_917)) (.cse2 (= |v_main_#t~pre4_89| |v_main_#t~pre4_88|)) (.cse3 (= |v_main_#t~pre5_336| |v_main_#t~pre5_333|))) (or (and (= v_main_~b~0_431 v_main_~b~0_427) .cse0 (= |v_main_#t~pre6_564| |v_main_#t~pre6_550|) .cse1 .cse2 .cse3) (and .cse0 (= |v_main_#t~pre6_550| |v_main_#t~pre6_564|) (= v_main_~b~0_427 v_main_~b~0_431) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_934, main_~b~0=v_main_~b~0_431, main_#t~pre4=|v_main_#t~pre4_89|, main_#t~pre5=|v_main_#t~pre5_336|, main_~a~0=v_main_~a~0_112, main_#t~pre6=|v_main_#t~pre6_564|} OutVars{main_~c~0=v_main_~c~0_917, main_~b~0=v_main_~b~0_427, main_#t~pre4=|v_main_#t~pre4_88|, main_#t~pre5=|v_main_#t~pre5_333|, main_~a~0=v_main_~a~0_111, main_#t~pre6=|v_main_#t~pre6_550|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5131#(= main_~a~0 0)} is VALID [2022-04-28 04:08:29,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {5131#(= main_~a~0 0)} [93] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {5127#false} is VALID [2022-04-28 04:08:29,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {5127#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5127#false} is VALID [2022-04-28 04:08:29,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#false} assume !false; {5127#false} is VALID [2022-04-28 04:08:29,830 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:29,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:29,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522338543] [2022-04-28 04:08:29,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522338543] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:29,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:29,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:30,207 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:30,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687426777] [2022-04-28 04:08:30,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687426777] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:30,208 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:30,208 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 04:08:30,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553195410] [2022-04-28 04:08:30,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:30,208 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 04:08:30,209 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:30,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:30,243 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-28 04:08:30,244 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 04:08:30,244 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:30,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 04:08:30,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=437, Unknown=0, NotChecked=0, Total=506 [2022-04-28 04:08:30,245 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,408 INFO L93 Difference]: Finished difference Result 67 states and 74 transitions. [2022-04-28 04:08:31,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-28 04:08:31,408 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 49 [2022-04-28 04:08:31,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:31,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-04-28 04:08:31,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 74 transitions. [2022-04-28 04:08:31,411 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 74 transitions. [2022-04-28 04:08:31,503 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-28 04:08:31,503 INFO L225 Difference]: With dead ends: 67 [2022-04-28 04:08:31,503 INFO L226 Difference]: Without dead ends: 58 [2022-04-28 04:08:31,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 20 SyntacticMatches, 9 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=201, Invalid=1605, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:08:31,504 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:31,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 37 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:08:31,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-28 04:08:31,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 52. [2022-04-28 04:08:31,515 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:31,516 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,516 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,516 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,517 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-28 04:08:31,517 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 04:08:31,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:31,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:31,518 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 04:08:31,518 INFO L87 Difference]: Start difference. First operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 58 states. [2022-04-28 04:08:31,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:31,519 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2022-04-28 04:08:31,519 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-28 04:08:31,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:31,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:31,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:31,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:31,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.0625) internal successors, (51), 48 states have internal predecessors, (51), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 54 transitions. [2022-04-28 04:08:31,520 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 54 transitions. Word has length 49 [2022-04-28 04:08:31,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:31,520 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 54 transitions. [2022-04-28 04:08:31,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.0) internal successors, (46), 22 states have internal predecessors, (46), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:31,521 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 54 transitions. [2022-04-28 04:08:31,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:31,592 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 54 transitions. [2022-04-28 04:08:31,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-28 04:08:31,593 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:31,593 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:31,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-04-28 04:08:31,593 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:31,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:31,593 INFO L85 PathProgramCache]: Analyzing trace with hash -292770539, now seen corresponding path program 17 times [2022-04-28 04:08:31,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:31,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [415368150] [2022-04-28 04:08:33,853 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:33,942 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,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-28 04:08:36,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,359 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-28 04:08:36,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:36,365 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:36,486 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:36,487 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:36,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1695107407, now seen corresponding path program 1 times [2022-04-28 04:08:36,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:36,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039302288] [2022-04-28 04:08:36,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:36,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:36,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:36,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5548#true} is VALID [2022-04-28 04:08:36,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {5548#true} assume true; {5548#true} is VALID [2022-04-28 04:08:36,526 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5548#true} {5548#true} #56#return; {5548#true} is VALID [2022-04-28 04:08:36,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {5548#true} call ULTIMATE.init(); {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:36,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {5554#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5548#true} is VALID [2022-04-28 04:08:36,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {5548#true} assume true; {5548#true} is VALID [2022-04-28 04:08:36,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5548#true} {5548#true} #56#return; {5548#true} is VALID [2022-04-28 04:08:36,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {5548#true} call #t~ret7 := main(); {5548#true} is VALID [2022-04-28 04:08:36,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {5548#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5553#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,528 INFO L290 TraceCheckUtils]: 6: Hoare triple {5553#(= main_~a~0 0)} [96] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_363| |v_main_#t~pre5_360|) (= v_main_~a~0_118 v_main_~a~0_117) (= v_main_~b~0_466 v_main_~b~0_462) (= v_main_~c~0_1018 v_main_~c~0_1000) (= |v_main_#t~pre6_611| |v_main_#t~pre6_596|) (= |v_main_#t~pre4_94| |v_main_#t~pre4_93|)) InVars {main_~c~0=v_main_~c~0_1018, main_~b~0=v_main_~b~0_466, main_#t~pre4=|v_main_#t~pre4_94|, main_#t~pre5=|v_main_#t~pre5_363|, main_~a~0=v_main_~a~0_118, main_#t~pre6=|v_main_#t~pre6_611|} OutVars{main_~c~0=v_main_~c~0_1000, main_~b~0=v_main_~b~0_462, main_#t~pre4=|v_main_#t~pre4_93|, main_#t~pre5=|v_main_#t~pre5_360|, main_~a~0=v_main_~a~0_117, main_#t~pre6=|v_main_#t~pre6_596|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5553#(= main_~a~0 0)} is VALID [2022-04-28 04:08:36,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {5553#(= main_~a~0 0)} [95] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {5549#false} is VALID [2022-04-28 04:08:36,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {5549#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5549#false} is VALID [2022-04-28 04:08:36,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {5549#false} assume !false; {5549#false} is VALID [2022-04-28 04:08:36,529 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:36,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:36,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039302288] [2022-04-28 04:08:36,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039302288] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:36,939 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:36,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [415368150] [2022-04-28 04:08:36,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [415368150] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-28 04:08:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39433047] [2022-04-28 04:08:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:36,940 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 04:08:36,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:36,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:36,974 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:36,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-28 04:08:36,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:36,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-28 04:08:36,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=480, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:08:36,975 INFO L87 Difference]: Start difference. First operand 52 states and 54 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,150 INFO L93 Difference]: Finished difference Result 69 states and 76 transitions. [2022-04-28 04:08:38,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 04:08:38,151 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-04-28 04:08:38,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:38,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-28 04:08:38,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 76 transitions. [2022-04-28 04:08:38,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 76 transitions. [2022-04-28 04:08:38,214 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-28 04:08:38,215 INFO L225 Difference]: With dead ends: 69 [2022-04-28 04:08:38,215 INFO L226 Difference]: Without dead ends: 60 [2022-04-28 04:08:38,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 25 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=210, Invalid=1770, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:08:38,216 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:38,216 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 47 Invalid, 718 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 676 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-28 04:08:38,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-28 04:08:38,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 54. [2022-04-28 04:08:38,230 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:38,231 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,231 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,231 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,232 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 04:08:38,232 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 04:08:38,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,233 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 04:08:38,233 INFO L87 Difference]: Start difference. First operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 60 states. [2022-04-28 04:08:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:38,234 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-04-28 04:08:38,234 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-28 04:08:38,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:38,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:38,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:38,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:38,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2022-04-28 04:08:38,235 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 51 [2022-04-28 04:08:38,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:38,235 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2022-04-28 04:08:38,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:38,236 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 56 transitions. [2022-04-28 04:08:38,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2022-04-28 04:08:38,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-28 04:08:38,317 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:38,317 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:38,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-04-28 04:08:38,317 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:38,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:38,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1478106573, now seen corresponding path program 18 times [2022-04-28 04:08:38,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:38,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [371342226] [2022-04-28 04:08:40,685 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:40,775 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:44,865 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:44,917 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:45,006 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:45,055 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-28 04:08:45,170 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-28 04:08:45,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:45,300 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:45,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1695168911, now seen corresponding path program 1 times [2022-04-28 04:08:45,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:45,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649138834] [2022-04-28 04:08:45,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:45,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:45,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:45,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:45,331 INFO L290 TraceCheckUtils]: 0: Hoare triple {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-28 04:08:45,331 INFO L290 TraceCheckUtils]: 1: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 04:08:45,331 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5985#true} {5985#true} #56#return; {5985#true} is VALID [2022-04-28 04:08:45,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {5985#true} call ULTIMATE.init(); {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:45,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {5991#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {5985#true} is VALID [2022-04-28 04:08:45,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {5985#true} assume true; {5985#true} is VALID [2022-04-28 04:08:45,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5985#true} {5985#true} #56#return; {5985#true} is VALID [2022-04-28 04:08:45,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {5985#true} call #t~ret7 := main(); {5985#true} is VALID [2022-04-28 04:08:45,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {5985#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {5990#(= main_~a~0 0)} is VALID [2022-04-28 04:08:45,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {5990#(= main_~a~0 0)} [98] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_124 v_main_~a~0_123)) (.cse1 (= |v_main_#t~pre6_664| |v_main_#t~pre6_648|)) (.cse2 (= |v_main_#t~pre4_99| |v_main_#t~pre4_98|)) (.cse3 (= v_main_~b~0_504 v_main_~b~0_500))) (or (and .cse0 .cse1 .cse2 (= v_main_~c~0_1109 v_main_~c~0_1090) .cse3 (= |v_main_#t~pre5_394| |v_main_#t~pre5_391|)) (and .cse0 (= |v_main_#t~pre5_391| |v_main_#t~pre5_394|) .cse1 (= v_main_~c~0_1090 v_main_~c~0_1109) .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1109, main_~b~0=v_main_~b~0_504, main_#t~pre4=|v_main_#t~pre4_99|, main_#t~pre5=|v_main_#t~pre5_394|, main_~a~0=v_main_~a~0_124, main_#t~pre6=|v_main_#t~pre6_664|} OutVars{main_~c~0=v_main_~c~0_1090, main_~b~0=v_main_~b~0_500, main_#t~pre4=|v_main_#t~pre4_98|, main_#t~pre5=|v_main_#t~pre5_391|, main_~a~0=v_main_~a~0_123, main_#t~pre6=|v_main_#t~pre6_648|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {5990#(= main_~a~0 0)} is VALID [2022-04-28 04:08:45,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {5990#(= main_~a~0 0)} [97] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {5986#false} is VALID [2022-04-28 04:08:45,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {5986#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {5986#false} is VALID [2022-04-28 04:08:45,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {5986#false} assume !false; {5986#false} is VALID [2022-04-28 04:08:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:45,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:45,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649138834] [2022-04-28 04:08:45,337 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649138834] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:45,337 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:45,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:45,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:45,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [371342226] [2022-04-28 04:08:45,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [371342226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:45,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:45,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-28 04:08:45,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334383934] [2022-04-28 04:08:45,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:45,769 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 04:08:45,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:45,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:45,805 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:45,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-28 04:08:45,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:45,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-28 04:08:45,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2022-04-28 04:08:45,805 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:47,288 INFO L93 Difference]: Finished difference Result 71 states and 78 transitions. [2022-04-28 04:08:47,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-28 04:08:47,288 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 53 [2022-04-28 04:08:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:47,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-28 04:08:47,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 78 transitions. [2022-04-28 04:08:47,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 78 transitions. [2022-04-28 04:08:47,361 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-28 04:08:47,362 INFO L225 Difference]: With dead ends: 71 [2022-04-28 04:08:47,362 INFO L226 Difference]: Without dead ends: 62 [2022-04-28 04:08:47,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=219, Invalid=1943, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:08:47,363 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 967 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:47,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 87 Invalid, 967 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-28 04:08:47,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-04-28 04:08:47,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 56. [2022-04-28 04:08:47,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:47,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,374 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,374 INFO L87 Difference]: Start difference. First operand 62 states. Second operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:47,376 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-28 04:08:47,376 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 04:08:47,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:47,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:47,376 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 04:08:47,376 INFO L87 Difference]: Start difference. First operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 62 states. [2022-04-28 04:08:47,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:47,377 INFO L93 Difference]: Finished difference Result 62 states and 66 transitions. [2022-04-28 04:08:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-28 04:08:47,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:47,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:47,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:47,378 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:47,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-04-28 04:08:47,379 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 53 [2022-04-28 04:08:47,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:47,379 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-04-28 04:08:47,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.0) internal successors, (50), 24 states have internal predecessors, (50), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:47,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 58 transitions. [2022-04-28 04:08:47,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:47,469 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-04-28 04:08:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-28 04:08:47,469 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:47,469 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:47,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-04-28 04:08:47,470 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:47,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:47,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1875265489, now seen corresponding path program 19 times [2022-04-28 04:08:47,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:47,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1192592166] [2022-04-28 04:08:50,831 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:50,883 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:50,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:55,083 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:08:55,135 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:55,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:55,273 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-28 04:08:55,280 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:08:55,280 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:08:55,415 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:08:55,416 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:08:55,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1695230415, now seen corresponding path program 1 times [2022-04-28 04:08:55,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:08:55,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274796923] [2022-04-28 04:08:55,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:08:55,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:08:55,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:55,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:08:55,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:08:55,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6437#true} is VALID [2022-04-28 04:08:55,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6437#true} assume true; {6437#true} is VALID [2022-04-28 04:08:55,446 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6437#true} {6437#true} #56#return; {6437#true} is VALID [2022-04-28 04:08:55,446 INFO L272 TraceCheckUtils]: 0: Hoare triple {6437#true} call ULTIMATE.init(); {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:08:55,446 INFO L290 TraceCheckUtils]: 1: Hoare triple {6443#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6437#true} is VALID [2022-04-28 04:08:55,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {6437#true} assume true; {6437#true} is VALID [2022-04-28 04:08:55,446 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6437#true} {6437#true} #56#return; {6437#true} is VALID [2022-04-28 04:08:55,447 INFO L272 TraceCheckUtils]: 4: Hoare triple {6437#true} call #t~ret7 := main(); {6437#true} is VALID [2022-04-28 04:08:55,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {6437#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6442#(= main_~a~0 0)} is VALID [2022-04-28 04:08:55,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {6442#(= main_~a~0 0)} [100] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_715| |v_main_#t~pre6_698|)) (.cse1 (= v_main_~b~0_539 v_main_~b~0_535)) (.cse2 (= |v_main_#t~pre4_104| |v_main_#t~pre4_103|)) (.cse3 (= v_main_~c~0_1199 v_main_~c~0_1179))) (or (and .cse0 (= |v_main_#t~pre5_418| |v_main_#t~pre5_421|) .cse1 (= v_main_~a~0_129 v_main_~a~0_130) .cse2 .cse3) (and (= |v_main_#t~pre5_421| |v_main_#t~pre5_418|) .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_130 v_main_~a~0_129)))) InVars {main_~c~0=v_main_~c~0_1199, main_~b~0=v_main_~b~0_539, main_#t~pre4=|v_main_#t~pre4_104|, main_#t~pre5=|v_main_#t~pre5_421|, main_~a~0=v_main_~a~0_130, main_#t~pre6=|v_main_#t~pre6_715|} OutVars{main_~c~0=v_main_~c~0_1179, main_~b~0=v_main_~b~0_535, main_#t~pre4=|v_main_#t~pre4_103|, main_#t~pre5=|v_main_#t~pre5_418|, main_~a~0=v_main_~a~0_129, main_#t~pre6=|v_main_#t~pre6_698|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6442#(= main_~a~0 0)} is VALID [2022-04-28 04:08:55,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {6442#(= main_~a~0 0)} [99] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {6438#false} is VALID [2022-04-28 04:08:55,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {6438#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6438#false} is VALID [2022-04-28 04:08:55,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {6438#false} assume !false; {6438#false} is VALID [2022-04-28 04:08:55,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:08:55,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:08:55,448 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274796923] [2022-04-28 04:08:55,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274796923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:55,449 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:55,449 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:08:55,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:08:55,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1192592166] [2022-04-28 04:08:55,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1192592166] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:08:55,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:08:55,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-28 04:08:55,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562597668] [2022-04-28 04:08:55,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:08:55,888 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 04:08:55,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:08:55,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:55,925 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-28 04:08:55,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-28 04:08:55,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:55,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-28 04:08:55,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2022-04-28 04:08:55,926 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:57,516 INFO L93 Difference]: Finished difference Result 75 states and 83 transitions. [2022-04-28 04:08:57,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 04:08:57,517 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 55 [2022-04-28 04:08:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:08:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 04:08:57,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 83 transitions. [2022-04-28 04:08:57,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 83 transitions. [2022-04-28 04:08:57,591 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-28 04:08:57,592 INFO L225 Difference]: With dead ends: 75 [2022-04-28 04:08:57,592 INFO L226 Difference]: Without dead ends: 66 [2022-04-28 04:08:57,593 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 9 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=2124, Unknown=0, NotChecked=0, Total=2352 [2022-04-28 04:08:57,593 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 71 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 1014 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1063 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 1014 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:08:57,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 87 Invalid, 1063 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 1014 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:08:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-04-28 04:08:57,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 60. [2022-04-28 04:08:57,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:08:57,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,611 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,611 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:57,612 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-28 04:08:57,612 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 04:08:57,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:57,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:57,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 04:08:57,613 INFO L87 Difference]: Start difference. First operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 66 states. [2022-04-28 04:08:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:08:57,614 INFO L93 Difference]: Finished difference Result 66 states and 70 transitions. [2022-04-28 04:08:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-28 04:08:57,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:08:57,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:08:57,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:08:57,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:08:57,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-04-28 04:08:57,615 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 55 [2022-04-28 04:08:57,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:08:57,617 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-04-28 04:08:57,617 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 25 states have internal predecessors, (52), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:08:57,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 62 transitions. [2022-04-28 04:08:57,709 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:08:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-04-28 04:08:57,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-28 04:08:57,710 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:08:57,710 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:08:57,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-04-28 04:08:57,711 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:08:57,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:08:57,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1054622225, now seen corresponding path program 20 times [2022-04-28 04:08:57,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:08:57,711 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310480825] [2022-04-28 04:09:01,906 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:01,960 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:02,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-28 04:09:06,142 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:06,195 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:06,287 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:06,312 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:06,312 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:09:06,453 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:06,454 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:06,454 INFO L85 PathProgramCache]: Analyzing trace with hash 1695291919, now seen corresponding path program 1 times [2022-04-28 04:09:06,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:06,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197175816] [2022-04-28 04:09:06,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:06,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:06,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:06,486 INFO L290 TraceCheckUtils]: 0: Hoare triple {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6916#true} is VALID [2022-04-28 04:09:06,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {6916#true} assume true; {6916#true} is VALID [2022-04-28 04:09:06,486 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6916#true} {6916#true} #56#return; {6916#true} is VALID [2022-04-28 04:09:06,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {6916#true} call ULTIMATE.init(); {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:06,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {6922#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {6916#true} is VALID [2022-04-28 04:09:06,487 INFO L290 TraceCheckUtils]: 2: Hoare triple {6916#true} assume true; {6916#true} is VALID [2022-04-28 04:09:06,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6916#true} {6916#true} #56#return; {6916#true} is VALID [2022-04-28 04:09:06,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {6916#true} call #t~ret7 := main(); {6916#true} is VALID [2022-04-28 04:09:06,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {6916#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {6921#(= main_~a~0 0)} is VALID [2022-04-28 04:09:06,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {6921#(= main_~a~0 0)} [102] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_136 v_main_~a~0_135)) (.cse1 (= |v_main_#t~pre4_109| |v_main_#t~pre4_108|)) (.cse2 (= |v_main_#t~pre6_757| |v_main_#t~pre6_739|)) (.cse3 (= v_main_~b~0_567 v_main_~b~0_563)) (.cse4 (= v_main_~c~0_1280 v_main_~c~0_1259))) (or (and (= |v_main_#t~pre5_439| |v_main_#t~pre5_442|) .cse0 .cse1 .cse2 .cse3 .cse4) (and (= |v_main_#t~pre5_442| |v_main_#t~pre5_439|) .cse0 .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1280, main_~b~0=v_main_~b~0_567, main_#t~pre4=|v_main_#t~pre4_109|, main_#t~pre5=|v_main_#t~pre5_442|, main_~a~0=v_main_~a~0_136, main_#t~pre6=|v_main_#t~pre6_757|} OutVars{main_~c~0=v_main_~c~0_1259, main_~b~0=v_main_~b~0_563, main_#t~pre4=|v_main_#t~pre4_108|, main_#t~pre5=|v_main_#t~pre5_439|, main_~a~0=v_main_~a~0_135, main_#t~pre6=|v_main_#t~pre6_739|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {6921#(= main_~a~0 0)} is VALID [2022-04-28 04:09:06,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {6921#(= main_~a~0 0)} [101] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {6917#false} is VALID [2022-04-28 04:09:06,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {6917#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {6917#false} is VALID [2022-04-28 04:09:06,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {6917#false} assume !false; {6917#false} is VALID [2022-04-28 04:09:06,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-28 04:09:06,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:06,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197175816] [2022-04-28 04:09:06,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197175816] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,489 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:06,998 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:06,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310480825] [2022-04-28 04:09:06,998 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310480825] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:06,998 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:06,998 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-28 04:09:06,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005360511] [2022-04-28 04:09:06,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:06,999 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 04:09:06,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:06,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:07,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:07,043 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-28 04:09:07,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:07,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-28 04:09:07,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=621, Unknown=0, NotChecked=0, Total=702 [2022-04-28 04:09:07,044 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,641 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-04-28 04:09:08,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-28 04:09:08,641 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 57 [2022-04-28 04:09:08,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:08,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 83 transitions. [2022-04-28 04:09:08,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 83 transitions. [2022-04-28 04:09:08,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 83 transitions. [2022-04-28 04:09:08,727 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-28 04:09:08,728 INFO L225 Difference]: With dead ends: 76 [2022-04-28 04:09:08,728 INFO L226 Difference]: Without dead ends: 67 [2022-04-28 04:09:08,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 25 SyntacticMatches, 8 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=237, Invalid=2313, Unknown=0, NotChecked=0, Total=2550 [2022-04-28 04:09:08,730 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:08,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 72 Invalid, 984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-28 04:09:08,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-04-28 04:09:08,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-04-28 04:09:08,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:08,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,752 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,752 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,753 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 04:09:08,753 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 04:09:08,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:08,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:08,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 04:09:08,754 INFO L87 Difference]: Start difference. First operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 67 states. [2022-04-28 04:09:08,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:08,755 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-04-28 04:09:08,755 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-04-28 04:09:08,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:08,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:08,756 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:08,756 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:08,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-04-28 04:09:08,757 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 57 [2022-04-28 04:09:08,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:08,757 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-04-28 04:09:08,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.0) internal successors, (54), 26 states have internal predecessors, (54), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:08,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 64 transitions. [2022-04-28 04:09:08,863 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-28 04:09:08,863 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-04-28 04:09:08,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2022-04-28 04:09:08,864 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:08,864 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:08,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-04-28 04:09:08,864 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:08,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:08,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1523469894, now seen corresponding path program 21 times [2022-04-28 04:09:08,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:08,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [724129703] [2022-04-28 04:09:09,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-28 04:09:09,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-28 04:09:09,347 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:09,433 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:13,536 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:13,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-28 04:09:13,642 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-28 04:09:13,786 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:13,786 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:13,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1695353423, now seen corresponding path program 1 times [2022-04-28 04:09:13,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:13,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171779239] [2022-04-28 04:09:13,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:13,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:13,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:13,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:13,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:13,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7406#true} is VALID [2022-04-28 04:09:13,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {7406#true} assume true; {7406#true} is VALID [2022-04-28 04:09:13,814 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7406#true} {7406#true} #56#return; {7406#true} is VALID [2022-04-28 04:09:13,814 INFO L272 TraceCheckUtils]: 0: Hoare triple {7406#true} call ULTIMATE.init(); {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:13,814 INFO L290 TraceCheckUtils]: 1: Hoare triple {7412#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7406#true} is VALID [2022-04-28 04:09:13,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {7406#true} assume true; {7406#true} is VALID [2022-04-28 04:09:13,814 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7406#true} {7406#true} #56#return; {7406#true} is VALID [2022-04-28 04:09:13,815 INFO L272 TraceCheckUtils]: 4: Hoare triple {7406#true} call #t~ret7 := main(); {7406#true} is VALID [2022-04-28 04:09:13,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {7406#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7411#(= main_~a~0 0)} is VALID [2022-04-28 04:09:13,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {7411#(= main_~a~0 0)} [104] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_474| |v_main_#t~pre5_470|)) (.cse1 (= |v_main_#t~pre6_803| |v_main_#t~pre6_785|)) (.cse2 (= v_main_~c~0_1373 v_main_~c~0_1351)) (.cse3 (= |v_main_#t~pre4_114| |v_main_#t~pre4_113|)) (.cse4 (= v_main_~a~0_142 v_main_~a~0_141))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~b~0_602 v_main_~b~0_607)) (and .cse0 .cse1 .cse2 (= v_main_~b~0_607 v_main_~b~0_602) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1373, main_~b~0=v_main_~b~0_607, main_#t~pre4=|v_main_#t~pre4_114|, main_#t~pre5=|v_main_#t~pre5_474|, main_~a~0=v_main_~a~0_142, main_#t~pre6=|v_main_#t~pre6_803|} OutVars{main_~c~0=v_main_~c~0_1351, main_~b~0=v_main_~b~0_602, main_#t~pre4=|v_main_#t~pre4_113|, main_#t~pre5=|v_main_#t~pre5_470|, main_~a~0=v_main_~a~0_141, main_#t~pre6=|v_main_#t~pre6_785|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7411#(= main_~a~0 0)} is VALID [2022-04-28 04:09:13,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {7411#(= main_~a~0 0)} [103] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {7407#false} is VALID [2022-04-28 04:09:13,820 INFO L290 TraceCheckUtils]: 8: Hoare triple {7407#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7407#false} is VALID [2022-04-28 04:09:13,820 INFO L290 TraceCheckUtils]: 9: Hoare triple {7407#false} assume !false; {7407#false} is VALID [2022-04-28 04:09:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:13,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:13,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171779239] [2022-04-28 04:09:13,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171779239] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:13,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:13,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:14,355 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:14,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [724129703] [2022-04-28 04:09:14,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [724129703] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:14,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:14,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-28 04:09:14,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016123018] [2022-04-28 04:09:14,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:14,356 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 04:09:14,356 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:14,357 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:14,406 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-28 04:09:14,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-28 04:09:14,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:14,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-28 04:09:14,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2022-04-28 04:09:14,407 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:16,195 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2022-04-28 04:09:16,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 04:09:16,195 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 60 [2022-04-28 04:09:16,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-28 04:09:16,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 85 transitions. [2022-04-28 04:09:16,197 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 85 transitions. [2022-04-28 04:09:16,285 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-28 04:09:16,286 INFO L225 Difference]: With dead ends: 78 [2022-04-28 04:09:16,286 INFO L226 Difference]: Without dead ends: 69 [2022-04-28 04:09:16,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 29 SyntacticMatches, 6 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=2510, Unknown=0, NotChecked=0, Total=2756 [2022-04-28 04:09:16,287 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 73 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1073 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 1125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1073 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:16,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 52 Invalid, 1125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1073 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-28 04:09:16,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-28 04:09:16,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 63. [2022-04-28 04:09:16,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:16,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,306 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,306 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:16,307 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 04:09:16,307 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 04:09:16,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:16,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:16,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 04:09:16,308 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 69 states. [2022-04-28 04:09:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:16,308 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2022-04-28 04:09:16,309 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2022-04-28 04:09:16,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:16,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:16,309 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:16,309 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:16,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 65 transitions. [2022-04-28 04:09:16,310 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 65 transitions. Word has length 60 [2022-04-28 04:09:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:16,310 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 65 transitions. [2022-04-28 04:09:16,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.0357142857142856) internal successors, (57), 27 states have internal predecessors, (57), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:16,310 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 65 transitions. [2022-04-28 04:09:16,425 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:16,425 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 65 transitions. [2022-04-28 04:09:16,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-28 04:09:16,425 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:16,425 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:16,426 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-04-28 04:09:16,426 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:16,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:16,426 INFO L85 PathProgramCache]: Analyzing trace with hash 172227364, now seen corresponding path program 22 times [2022-04-28 04:09:16,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:16,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960789010] [2022-04-28 04:09:16,652 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:16,740 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:16,848 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:16,938 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:16,986 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-28 04:09:16,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:16,993 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:09:17,128 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:17,128 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:17,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1695414927, now seen corresponding path program 1 times [2022-04-28 04:09:17,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:17,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554981982] [2022-04-28 04:09:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:17,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:17,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:17,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7909#true} is VALID [2022-04-28 04:09:17,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 04:09:17,161 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7909#true} {7909#true} #56#return; {7909#true} is VALID [2022-04-28 04:09:17,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {7909#true} call ULTIMATE.init(); {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:17,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {7915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {7909#true} is VALID [2022-04-28 04:09:17,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {7909#true} assume true; {7909#true} is VALID [2022-04-28 04:09:17,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7909#true} {7909#true} #56#return; {7909#true} is VALID [2022-04-28 04:09:17,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {7909#true} call #t~ret7 := main(); {7909#true} is VALID [2022-04-28 04:09:17,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {7909#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {7914#(= main_~a~0 0)} is VALID [2022-04-28 04:09:17,163 INFO L290 TraceCheckUtils]: 6: Hoare triple {7914#(= main_~a~0 0)} [106] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_502| |v_main_#t~pre5_498|) (= v_main_~a~0_148 v_main_~a~0_147) (= v_main_~c~0_1465 v_main_~c~0_1442) (= |v_main_#t~pre6_852| |v_main_#t~pre6_833|) (= v_main_~b~0_644 v_main_~b~0_639) (= |v_main_#t~pre4_119| |v_main_#t~pre4_118|)) InVars {main_~c~0=v_main_~c~0_1465, main_~b~0=v_main_~b~0_644, main_#t~pre4=|v_main_#t~pre4_119|, main_#t~pre5=|v_main_#t~pre5_502|, main_~a~0=v_main_~a~0_148, main_#t~pre6=|v_main_#t~pre6_852|} OutVars{main_~c~0=v_main_~c~0_1442, main_~b~0=v_main_~b~0_639, main_#t~pre4=|v_main_#t~pre4_118|, main_#t~pre5=|v_main_#t~pre5_498|, main_~a~0=v_main_~a~0_147, main_#t~pre6=|v_main_#t~pre6_833|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {7914#(= main_~a~0 0)} is VALID [2022-04-28 04:09:17,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {7914#(= main_~a~0 0)} [105] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {7910#false} is VALID [2022-04-28 04:09:17,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {7910#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {7910#false} is VALID [2022-04-28 04:09:17,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#false} assume !false; {7910#false} is VALID [2022-04-28 04:09:17,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:17,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:17,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554981982] [2022-04-28 04:09:17,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554981982] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:17,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:17,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:17,679 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:17,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960789010] [2022-04-28 04:09:17,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960789010] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:17,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:17,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-28 04:09:17,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540529647] [2022-04-28 04:09:17,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:17,680 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 04:09:17,680 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:17,680 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:17,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:17,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-28 04:09:17,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:17,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-28 04:09:17,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=725, Unknown=0, NotChecked=0, Total=812 [2022-04-28 04:09:17,723 INFO L87 Difference]: Start difference. First operand 63 states and 65 transitions. Second operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:19,780 INFO L93 Difference]: Finished difference Result 80 states and 87 transitions. [2022-04-28 04:09:19,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-28 04:09:19,781 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 62 [2022-04-28 04:09:19,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:19,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-28 04:09:19,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 87 transitions. [2022-04-28 04:09:19,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 87 transitions. [2022-04-28 04:09:19,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:19,872 INFO L225 Difference]: With dead ends: 80 [2022-04-28 04:09:19,872 INFO L226 Difference]: Without dead ends: 71 [2022-04-28 04:09:19,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 29 SyntacticMatches, 7 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=255, Invalid=2715, Unknown=0, NotChecked=0, Total=2970 [2022-04-28 04:09:19,874 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 82 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1323 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:19,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 62 Invalid, 1383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1323 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:09:19,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-28 04:09:19,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2022-04-28 04:09:19,895 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:19,895 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,895 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,895 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:19,896 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 04:09:19,897 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 04:09:19,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:19,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:19,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 04:09:19,897 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 71 states. [2022-04-28 04:09:19,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:19,898 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2022-04-28 04:09:19,898 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2022-04-28 04:09:19,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:19,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:19,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:19,899 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:19,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 61 states have internal predecessors, (64), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 67 transitions. [2022-04-28 04:09:19,900 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 67 transitions. Word has length 62 [2022-04-28 04:09:19,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:19,900 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 67 transitions. [2022-04-28 04:09:19,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.0344827586206895) internal successors, (59), 28 states have internal predecessors, (59), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:19,900 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 67 transitions. [2022-04-28 04:09:20,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:20,017 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 67 transitions. [2022-04-28 04:09:20,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-04-28 04:09:20,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:20,017 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:20,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-04-28 04:09:20,018 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:20,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:20,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1291720574, now seen corresponding path program 23 times [2022-04-28 04:09:20,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:20,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891439779] [2022-04-28 04:09:20,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-28 04:09:20,367 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,492 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,607 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,670 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-28 04:09:20,678 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:20,679 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:09:20,831 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:20,831 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:20,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1695476431, now seen corresponding path program 1 times [2022-04-28 04:09:20,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:20,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [449113085] [2022-04-28 04:09:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:20,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:20,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:20,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:20,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8427#true} is VALID [2022-04-28 04:09:20,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-04-28 04:09:20,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8427#true} {8427#true} #56#return; {8427#true} is VALID [2022-04-28 04:09:20,861 INFO L272 TraceCheckUtils]: 0: Hoare triple {8427#true} call ULTIMATE.init(); {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:20,861 INFO L290 TraceCheckUtils]: 1: Hoare triple {8433#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8427#true} is VALID [2022-04-28 04:09:20,861 INFO L290 TraceCheckUtils]: 2: Hoare triple {8427#true} assume true; {8427#true} is VALID [2022-04-28 04:09:20,861 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8427#true} {8427#true} #56#return; {8427#true} is VALID [2022-04-28 04:09:20,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {8427#true} call #t~ret7 := main(); {8427#true} is VALID [2022-04-28 04:09:20,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {8427#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {8432#(= main_~a~0 0)} is VALID [2022-04-28 04:09:20,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {8432#(= main_~a~0 0)} [108] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_530| |v_main_#t~pre5_526|) (= v_main_~c~0_1560 v_main_~c~0_1536) (= v_main_~b~0_681 v_main_~b~0_676) (= |v_main_#t~pre4_124| |v_main_#t~pre4_123|) (= |v_main_#t~pre6_903| |v_main_#t~pre6_883|) (= v_main_~a~0_154 v_main_~a~0_153)) InVars {main_~c~0=v_main_~c~0_1560, main_~b~0=v_main_~b~0_681, main_#t~pre4=|v_main_#t~pre4_124|, main_#t~pre5=|v_main_#t~pre5_530|, main_~a~0=v_main_~a~0_154, main_#t~pre6=|v_main_#t~pre6_903|} OutVars{main_~c~0=v_main_~c~0_1536, main_~b~0=v_main_~b~0_676, main_#t~pre4=|v_main_#t~pre4_123|, main_#t~pre5=|v_main_#t~pre5_526|, main_~a~0=v_main_~a~0_153, main_#t~pre6=|v_main_#t~pre6_883|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8432#(= main_~a~0 0)} is VALID [2022-04-28 04:09:20,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {8432#(= main_~a~0 0)} [107] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {8428#false} is VALID [2022-04-28 04:09:20,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {8428#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {8428#false} is VALID [2022-04-28 04:09:20,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {8428#false} assume !false; {8428#false} is VALID [2022-04-28 04:09:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:20,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [449113085] [2022-04-28 04:09:20,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [449113085] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:20,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:20,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:21,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:21,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891439779] [2022-04-28 04:09:21,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891439779] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:21,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:21,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-28 04:09:21,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964961718] [2022-04-28 04:09:21,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:21,505 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 04:09:21,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:21,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:21,550 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-28 04:09:21,550 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-28 04:09:21,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:21,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-28 04:09:21,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=780, Unknown=0, NotChecked=0, Total=870 [2022-04-28 04:09:21,551 INFO L87 Difference]: Start difference. First operand 65 states and 67 transitions. Second operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:23,596 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-04-28 04:09:23,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 04:09:23,596 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 64 [2022-04-28 04:09:23,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:23,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-28 04:09:23,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 89 transitions. [2022-04-28 04:09:23,598 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 89 transitions. [2022-04-28 04:09:23,664 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-28 04:09:23,665 INFO L225 Difference]: With dead ends: 82 [2022-04-28 04:09:23,665 INFO L226 Difference]: Without dead ends: 73 [2022-04-28 04:09:23,666 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 24 SyntacticMatches, 13 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 640 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=264, Invalid=2928, Unknown=0, NotChecked=0, Total=3192 [2022-04-28 04:09:23,667 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 85 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 1282 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:23,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 32 Invalid, 1344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1282 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-28 04:09:23,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-28 04:09:23,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 67. [2022-04-28 04:09:23,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:23,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,688 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,688 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:23,689 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-28 04:09:23,689 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-28 04:09:23,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:23,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:23,690 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 04:09:23,690 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 73 states. [2022-04-28 04:09:23,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:23,691 INFO L93 Difference]: Finished difference Result 73 states and 77 transitions. [2022-04-28 04:09:23,691 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 77 transitions. [2022-04-28 04:09:23,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:23,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:23,691 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:23,691 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:23,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 63 states have (on average 1.0476190476190477) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 69 transitions. [2022-04-28 04:09:23,693 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 69 transitions. Word has length 64 [2022-04-28 04:09:23,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:23,693 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 69 transitions. [2022-04-28 04:09:23,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.033333333333333) internal successors, (61), 29 states have internal predecessors, (61), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:23,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 69 transitions. [2022-04-28 04:09:23,798 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-28 04:09:23,798 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 69 transitions. [2022-04-28 04:09:23,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-28 04:09:23,799 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:23,799 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:23,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-04-28 04:09:23,800 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash 603584096, now seen corresponding path program 24 times [2022-04-28 04:09:23,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:23,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [944146252] [2022-04-28 04:09:27,998 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:28,061 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:28,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-28 04:09:32,248 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:32,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,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-28 04:09:32,437 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,445 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:32,445 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:09:32,605 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:32,605 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1695537935, now seen corresponding path program 1 times [2022-04-28 04:09:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:32,606 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77186495] [2022-04-28 04:09:32,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:32,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:32,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:32,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:32,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8960#true} is VALID [2022-04-28 04:09:32,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {8960#true} assume true; {8960#true} is VALID [2022-04-28 04:09:32,640 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8960#true} {8960#true} #56#return; {8960#true} is VALID [2022-04-28 04:09:32,640 INFO L272 TraceCheckUtils]: 0: Hoare triple {8960#true} call ULTIMATE.init(); {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:32,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {8966#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {8960#true} is VALID [2022-04-28 04:09:32,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {8960#true} assume true; {8960#true} is VALID [2022-04-28 04:09:32,641 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8960#true} {8960#true} #56#return; {8960#true} is VALID [2022-04-28 04:09:32,641 INFO L272 TraceCheckUtils]: 4: Hoare triple {8960#true} call #t~ret7 := main(); {8960#true} is VALID [2022-04-28 04:09:32,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {8960#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {8965#(= main_~a~0 0)} is VALID [2022-04-28 04:09:32,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {8965#(= main_~a~0 0)} [110] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_129| |v_main_#t~pre4_128|)) (.cse1 (= |v_main_#t~pre5_558| |v_main_#t~pre5_554|)) (.cse2 (= |v_main_#t~pre6_956| |v_main_#t~pre6_935|)) (.cse3 (= v_main_~c~0_1658 v_main_~c~0_1633))) (or (and .cse0 (= v_main_~b~0_713 v_main_~b~0_718) (= v_main_~a~0_159 v_main_~a~0_160) .cse1 .cse2 .cse3) (and .cse0 (= v_main_~b~0_718 v_main_~b~0_713) (= v_main_~a~0_160 v_main_~a~0_159) .cse1 .cse2 .cse3))) InVars {main_~c~0=v_main_~c~0_1658, main_~b~0=v_main_~b~0_718, main_#t~pre4=|v_main_#t~pre4_129|, main_#t~pre5=|v_main_#t~pre5_558|, main_~a~0=v_main_~a~0_160, main_#t~pre6=|v_main_#t~pre6_956|} OutVars{main_~c~0=v_main_~c~0_1633, main_~b~0=v_main_~b~0_713, main_#t~pre4=|v_main_#t~pre4_128|, main_#t~pre5=|v_main_#t~pre5_554|, main_~a~0=v_main_~a~0_159, main_#t~pre6=|v_main_#t~pre6_935|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {8965#(= main_~a~0 0)} is VALID [2022-04-28 04:09:32,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {8965#(= main_~a~0 0)} [109] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {8961#false} is VALID [2022-04-28 04:09:32,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {8961#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {8961#false} is VALID [2022-04-28 04:09:32,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {8961#false} assume !false; {8961#false} is VALID [2022-04-28 04:09:32,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-28 04:09:32,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:32,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77186495] [2022-04-28 04:09:32,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77186495] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:32,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:32,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:33,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:33,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [944146252] [2022-04-28 04:09:33,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [944146252] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:33,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:33,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-28 04:09:33,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598673072] [2022-04-28 04:09:33,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:33,336 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 04:09:33,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:33,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:33,380 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-28 04:09:33,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-28 04:09:33,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:33,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-28 04:09:33,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=837, Unknown=0, NotChecked=0, Total=930 [2022-04-28 04:09:33,382 INFO L87 Difference]: Start difference. First operand 67 states and 69 transitions. Second operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,865 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-04-28 04:09:35,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-28 04:09:35,865 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 66 [2022-04-28 04:09:35,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:35,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-28 04:09:35,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 91 transitions. [2022-04-28 04:09:35,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 91 transitions. [2022-04-28 04:09:35,961 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-28 04:09:35,962 INFO L225 Difference]: With dead ends: 84 [2022-04-28 04:09:35,962 INFO L226 Difference]: Without dead ends: 75 [2022-04-28 04:09:35,963 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 22 SyntacticMatches, 16 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 701 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=273, Invalid=3149, Unknown=0, NotChecked=0, Total=3422 [2022-04-28 04:09:35,963 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 87 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 1619 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 1683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 1619 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:35,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 117 Invalid, 1683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 1619 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-04-28 04:09:35,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-04-28 04:09:35,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 69. [2022-04-28 04:09:35,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:35,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,986 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,986 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,987 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 04:09:35,989 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 04:09:35,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:35,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:35,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 04:09:35,989 INFO L87 Difference]: Start difference. First operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 75 states. [2022-04-28 04:09:35,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:35,990 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-04-28 04:09:35,990 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-04-28 04:09:35,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:35,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:35,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:35,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:35,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 65 states have (on average 1.0461538461538462) internal successors, (68), 65 states have internal predecessors, (68), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2022-04-28 04:09:35,992 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 66 [2022-04-28 04:09:35,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:35,992 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2022-04-28 04:09:35,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.032258064516129) internal successors, (63), 30 states have internal predecessors, (63), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:35,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 71 transitions. [2022-04-28 04:09:36,139 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-28 04:09:36,139 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2022-04-28 04:09:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 04:09:36,140 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:36,140 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:36,140 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-04-28 04:09:36,140 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:36,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:36,141 INFO L85 PathProgramCache]: Analyzing trace with hash 925238462, now seen corresponding path program 25 times [2022-04-28 04:09:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:36,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [955512229] [2022-04-28 04:09:40,353 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:40,404 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:40,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-28 04:09:44,621 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:44,673 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:44,758 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:44,804 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-28 04:09:44,937 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-28 04:09:45,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:45,076 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:45,077 INFO L85 PathProgramCache]: Analyzing trace with hash 1695599439, now seen corresponding path program 1 times [2022-04-28 04:09:45,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:45,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296479954] [2022-04-28 04:09:45,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:45,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:45,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:45,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:45,102 INFO L290 TraceCheckUtils]: 0: Hoare triple {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9508#true} is VALID [2022-04-28 04:09:45,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {9508#true} assume true; {9508#true} is VALID [2022-04-28 04:09:45,102 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9508#true} {9508#true} #56#return; {9508#true} is VALID [2022-04-28 04:09:45,102 INFO L272 TraceCheckUtils]: 0: Hoare triple {9508#true} call ULTIMATE.init(); {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:45,102 INFO L290 TraceCheckUtils]: 1: Hoare triple {9514#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {9508#true} is VALID [2022-04-28 04:09:45,102 INFO L290 TraceCheckUtils]: 2: Hoare triple {9508#true} assume true; {9508#true} is VALID [2022-04-28 04:09:45,103 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9508#true} {9508#true} #56#return; {9508#true} is VALID [2022-04-28 04:09:45,103 INFO L272 TraceCheckUtils]: 4: Hoare triple {9508#true} call #t~ret7 := main(); {9508#true} is VALID [2022-04-28 04:09:45,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {9508#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {9513#(= main_~a~0 0)} is VALID [2022-04-28 04:09:45,108 INFO L290 TraceCheckUtils]: 6: Hoare triple {9513#(= main_~a~0 0)} [112] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_758 v_main_~b~0_753) (= |v_main_#t~pre5_590| |v_main_#t~pre5_586|) (= v_main_~c~0_1763 v_main_~c~0_1737) (= v_main_~a~0_166 v_main_~a~0_165) (= |v_main_#t~pre4_134| |v_main_#t~pre4_133|) (= |v_main_#t~pre6_1015| |v_main_#t~pre6_993|)) InVars {main_~c~0=v_main_~c~0_1763, main_~b~0=v_main_~b~0_758, main_#t~pre4=|v_main_#t~pre4_134|, main_#t~pre5=|v_main_#t~pre5_590|, main_~a~0=v_main_~a~0_166, main_#t~pre6=|v_main_#t~pre6_1015|} OutVars{main_~c~0=v_main_~c~0_1737, main_~b~0=v_main_~b~0_753, main_#t~pre4=|v_main_#t~pre4_133|, main_#t~pre5=|v_main_#t~pre5_586|, main_~a~0=v_main_~a~0_165, main_#t~pre6=|v_main_#t~pre6_993|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {9513#(= main_~a~0 0)} is VALID [2022-04-28 04:09:45,111 INFO L290 TraceCheckUtils]: 7: Hoare triple {9513#(= main_~a~0 0)} [111] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {9509#false} is VALID [2022-04-28 04:09:45,111 INFO L290 TraceCheckUtils]: 8: Hoare triple {9509#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {9509#false} is VALID [2022-04-28 04:09:45,111 INFO L290 TraceCheckUtils]: 9: Hoare triple {9509#false} assume !false; {9509#false} is VALID [2022-04-28 04:09:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:45,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:45,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296479954] [2022-04-28 04:09:45,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296479954] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:45,112 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:45,112 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:45,697 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:45,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [955512229] [2022-04-28 04:09:45,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [955512229] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:45,698 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:45,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-28 04:09:45,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89422695] [2022-04-28 04:09:45,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:45,698 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 04:09:45,698 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:45,698 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:45,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:45,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-28 04:09:45,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:45,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-28 04:09:45,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=896, Unknown=0, NotChecked=0, Total=992 [2022-04-28 04:09:45,751 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:47,935 INFO L93 Difference]: Finished difference Result 86 states and 93 transitions. [2022-04-28 04:09:47,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 04:09:47,935 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 68 [2022-04-28 04:09:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:09:47,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 93 transitions. [2022-04-28 04:09:47,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:47,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 93 transitions. [2022-04-28 04:09:47,937 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 93 transitions. [2022-04-28 04:09:48,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:48,007 INFO L225 Difference]: With dead ends: 86 [2022-04-28 04:09:48,007 INFO L226 Difference]: Without dead ends: 77 [2022-04-28 04:09:48,009 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 29 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 714 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=282, Invalid=3378, Unknown=0, NotChecked=0, Total=3660 [2022-04-28 04:09:48,009 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 81 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 1377 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 1377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:09:48,009 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 57 Invalid, 1437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 1377 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-28 04:09:48,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-28 04:09:48,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 71. [2022-04-28 04:09:48,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:09:48,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:48,029 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:48,029 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:48,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:48,030 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-28 04:09:48,030 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-28 04:09:48,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:48,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:48,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 04:09:48,031 INFO L87 Difference]: Start difference. First operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 77 states. [2022-04-28 04:09:48,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:09:48,032 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-04-28 04:09:48,032 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-04-28 04:09:48,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:09:48,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:09:48,032 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:09:48,032 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:09:48,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.044776119402985) internal successors, (70), 67 states have internal predecessors, (70), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:48,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 73 transitions. [2022-04-28 04:09:48,033 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 73 transitions. Word has length 68 [2022-04-28 04:09:48,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:09:48,034 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 73 transitions. [2022-04-28 04:09:48,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.03125) internal successors, (65), 31 states have internal predecessors, (65), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:48,034 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 73 transitions. [2022-04-28 04:09:48,160 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:09:48,161 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 73 transitions. [2022-04-28 04:09:48,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-28 04:09:48,161 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:09:48,161 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:09:48,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-04-28 04:09:48,161 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:09:48,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:09:48,162 INFO L85 PathProgramCache]: Analyzing trace with hash 797438876, now seen corresponding path program 26 times [2022-04-28 04:09:48,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:48,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1467666309] [2022-04-28 04:09:52,376 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:52,419 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:52,506 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,583 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:09:56,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-28 04:09:56,717 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,764 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-28 04:09:56,771 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:09:56,772 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:09:56,941 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:09:56,941 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:09:56,942 INFO L85 PathProgramCache]: Analyzing trace with hash 1695660943, now seen corresponding path program 1 times [2022-04-28 04:09:56,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:09:56,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477079506] [2022-04-28 04:09:56,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:09:56,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:09:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:56,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:09:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:09:56,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10071#true} is VALID [2022-04-28 04:09:56,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {10071#true} assume true; {10071#true} is VALID [2022-04-28 04:09:56,969 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10071#true} {10071#true} #56#return; {10071#true} is VALID [2022-04-28 04:09:56,970 INFO L272 TraceCheckUtils]: 0: Hoare triple {10071#true} call ULTIMATE.init(); {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:09:56,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {10077#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10071#true} is VALID [2022-04-28 04:09:56,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {10071#true} assume true; {10071#true} is VALID [2022-04-28 04:09:56,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10071#true} {10071#true} #56#return; {10071#true} is VALID [2022-04-28 04:09:56,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {10071#true} call #t~ret7 := main(); {10071#true} is VALID [2022-04-28 04:09:56,972 INFO L290 TraceCheckUtils]: 5: Hoare triple {10071#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10076#(= main_~a~0 0)} is VALID [2022-04-28 04:09:56,973 INFO L290 TraceCheckUtils]: 6: Hoare triple {10076#(= main_~a~0 0)} [114] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_1867 v_main_~c~0_1840)) (.cse1 (= v_main_~b~0_795 v_main_~b~0_790)) (.cse2 (= |v_main_#t~pre4_139| |v_main_#t~pre4_138|)) (.cse3 (= v_main_~a~0_172 v_main_~a~0_171)) (.cse4 (= |v_main_#t~pre6_1072| |v_main_#t~pre6_1049|))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_618| |v_main_#t~pre5_614|) .cse3 .cse4) (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_614| |v_main_#t~pre5_618|) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_1867, main_~b~0=v_main_~b~0_795, main_#t~pre4=|v_main_#t~pre4_139|, main_#t~pre5=|v_main_#t~pre5_618|, main_~a~0=v_main_~a~0_172, main_#t~pre6=|v_main_#t~pre6_1072|} OutVars{main_~c~0=v_main_~c~0_1840, main_~b~0=v_main_~b~0_790, main_#t~pre4=|v_main_#t~pre4_138|, main_#t~pre5=|v_main_#t~pre5_614|, main_~a~0=v_main_~a~0_171, main_#t~pre6=|v_main_#t~pre6_1049|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10076#(= main_~a~0 0)} is VALID [2022-04-28 04:09:56,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {10076#(= main_~a~0 0)} [113] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {10072#false} is VALID [2022-04-28 04:09:56,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {10072#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10072#false} is VALID [2022-04-28 04:09:56,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {10072#false} assume !false; {10072#false} is VALID [2022-04-28 04:09:56,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:09:56,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:09:56,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477079506] [2022-04-28 04:09:56,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477079506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:56,974 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:56,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:09:57,827 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:09:57,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1467666309] [2022-04-28 04:09:57,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1467666309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:09:57,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:09:57,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-28 04:09:57,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439731039] [2022-04-28 04:09:57,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:09:57,828 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 04:09:57,828 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:09:57,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:09:57,911 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-28 04:09:57,911 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-28 04:09:57,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:09:57,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-28 04:09:57,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=957, Unknown=0, NotChecked=0, Total=1056 [2022-04-28 04:09:57,913 INFO L87 Difference]: Start difference. First operand 71 states and 73 transitions. Second operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:00,729 INFO L93 Difference]: Finished difference Result 90 states and 98 transitions. [2022-04-28 04:10:00,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-28 04:10:00,730 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 70 [2022-04-28 04:10:00,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:00,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 98 transitions. [2022-04-28 04:10:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 98 transitions. [2022-04-28 04:10:00,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 98 transitions. [2022-04-28 04:10:00,829 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-28 04:10:00,830 INFO L225 Difference]: With dead ends: 90 [2022-04-28 04:10:00,830 INFO L226 Difference]: Without dead ends: 81 [2022-04-28 04:10:00,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 22 SyntacticMatches, 18 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=291, Invalid=3615, Unknown=0, NotChecked=0, Total=3906 [2022-04-28 04:10:00,832 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 84 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 1897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:00,832 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 142 Invalid, 1897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 1832 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-04-28 04:10:00,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-28 04:10:00,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 75. [2022-04-28 04:10:00,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:00,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,859 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,859 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:00,861 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-28 04:10:00,861 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-28 04:10:00,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:00,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:00,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 04:10:00,861 INFO L87 Difference]: Start difference. First operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 81 states. [2022-04-28 04:10:00,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:00,863 INFO L93 Difference]: Finished difference Result 81 states and 85 transitions. [2022-04-28 04:10:00,863 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 85 transitions. [2022-04-28 04:10:00,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:00,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:00,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:00,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:00,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-04-28 04:10:00,865 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 70 [2022-04-28 04:10:00,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:00,865 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-04-28 04:10:00,866 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 32 states have internal predecessors, (67), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:00,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 77 transitions. [2022-04-28 04:10:01,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:01,012 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-04-28 04:10:01,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-28 04:10:01,012 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:01,012 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:01,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-04-28 04:10:01,013 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:01,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:01,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1758878982, now seen corresponding path program 27 times [2022-04-28 04:10:01,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:01,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1277947578] [2022-04-28 04:10:01,295 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:01,385 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:01,508 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:01,595 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:01,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:01,619 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:01,763 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:01,763 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:01,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1695722447, now seen corresponding path program 1 times [2022-04-28 04:10:01,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:01,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183189128] [2022-04-28 04:10:01,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:01,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:01,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:01,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:01,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:01,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10661#true} is VALID [2022-04-28 04:10:01,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {10661#true} assume true; {10661#true} is VALID [2022-04-28 04:10:01,796 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10661#true} {10661#true} #56#return; {10661#true} is VALID [2022-04-28 04:10:01,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {10661#true} call ULTIMATE.init(); {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:01,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {10667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {10661#true} is VALID [2022-04-28 04:10:01,796 INFO L290 TraceCheckUtils]: 2: Hoare triple {10661#true} assume true; {10661#true} is VALID [2022-04-28 04:10:01,796 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10661#true} {10661#true} #56#return; {10661#true} is VALID [2022-04-28 04:10:01,797 INFO L272 TraceCheckUtils]: 4: Hoare triple {10661#true} call #t~ret7 := main(); {10661#true} is VALID [2022-04-28 04:10:01,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {10661#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {10666#(= main_~a~0 0)} is VALID [2022-04-28 04:10:01,800 INFO L290 TraceCheckUtils]: 6: Hoare triple {10666#(= main_~a~0 0)} [116] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_825 v_main_~b~0_820)) (.cse1 (= v_main_~a~0_178 v_main_~a~0_177)) (.cse2 (= |v_main_#t~pre6_1120| |v_main_#t~pre6_1096|)) (.cse3 (= |v_main_#t~pre4_144| |v_main_#t~pre4_143|))) (or (and .cse0 (= v_main_~c~0_1962 v_main_~c~0_1934) (= |v_main_#t~pre5_640| |v_main_#t~pre5_636|) .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 (= v_main_~c~0_1934 v_main_~c~0_1962) (= |v_main_#t~pre5_636| |v_main_#t~pre5_640|) .cse3))) InVars {main_~c~0=v_main_~c~0_1962, main_~b~0=v_main_~b~0_825, main_#t~pre4=|v_main_#t~pre4_144|, main_#t~pre5=|v_main_#t~pre5_640|, main_~a~0=v_main_~a~0_178, main_#t~pre6=|v_main_#t~pre6_1120|} OutVars{main_~c~0=v_main_~c~0_1934, main_~b~0=v_main_~b~0_820, main_#t~pre4=|v_main_#t~pre4_143|, main_#t~pre5=|v_main_#t~pre5_636|, main_~a~0=v_main_~a~0_177, main_#t~pre6=|v_main_#t~pre6_1096|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {10666#(= main_~a~0 0)} is VALID [2022-04-28 04:10:01,800 INFO L290 TraceCheckUtils]: 7: Hoare triple {10666#(= main_~a~0 0)} [115] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {10662#false} is VALID [2022-04-28 04:10:01,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {10662#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {10662#false} is VALID [2022-04-28 04:10:01,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {10662#false} assume !false; {10662#false} is VALID [2022-04-28 04:10:01,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:01,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:01,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183189128] [2022-04-28 04:10:01,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183189128] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:01,801 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:01,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:02,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:02,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1277947578] [2022-04-28 04:10:02,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1277947578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:02,510 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:02,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-28 04:10:02,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479736909] [2022-04-28 04:10:02,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:02,510 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 04:10:02,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:02,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:02,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:02,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-28 04:10:02,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:02,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-28 04:10:02,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 04:10:02,560 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,582 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2022-04-28 04:10:05,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 04:10:05,582 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 72 [2022-04-28 04:10:05,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:05,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2022-04-28 04:10:05,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 98 transitions. [2022-04-28 04:10:05,587 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 98 transitions. [2022-04-28 04:10:05,680 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-28 04:10:05,681 INFO L225 Difference]: With dead ends: 91 [2022-04-28 04:10:05,681 INFO L226 Difference]: Without dead ends: 82 [2022-04-28 04:10:05,682 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 30 SyntacticMatches, 11 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=3860, Unknown=0, NotChecked=0, Total=4160 [2022-04-28 04:10:05,683 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 92 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2088 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:05,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 137 Invalid, 2088 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2022-04-28 04:10:05,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-04-28 04:10:05,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2022-04-28 04:10:05,709 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:05,710 INFO L82 GeneralOperation]: Start isEquivalent. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,710 INFO L74 IsIncluded]: Start isIncluded. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,710 INFO L87 Difference]: Start difference. First operand 82 states. Second operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,712 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-28 04:10:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-28 04:10:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,712 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 04:10:05,712 INFO L87 Difference]: Start difference. First operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 82 states. [2022-04-28 04:10:05,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:05,714 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-04-28 04:10:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-28 04:10:05,714 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:05,714 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:05,714 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:05,714 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:05,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 73 states have internal predecessors, (76), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 79 transitions. [2022-04-28 04:10:05,719 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 79 transitions. Word has length 72 [2022-04-28 04:10:05,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:05,719 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 79 transitions. [2022-04-28 04:10:05,720 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.0294117647058822) internal successors, (69), 33 states have internal predecessors, (69), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:05,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 79 transitions. [2022-04-28 04:10:05,868 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-28 04:10:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 79 transitions. [2022-04-28 04:10:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 04:10:05,869 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:05,869 INFO L195 NwaCegarLoop]: trace histogram [24, 24, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:05,869 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-04-28 04:10:05,869 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:05,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:05,870 INFO L85 PathProgramCache]: Analyzing trace with hash 1925663067, now seen corresponding path program 28 times [2022-04-28 04:10:05,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:05,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1687806662] [2022-04-28 04:10:06,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-28 04:10:06,226 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:06,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:06,438 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:06,462 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:06,462 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:06,489 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-28 04:10:06,643 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:06,644 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:06,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1695783951, now seen corresponding path program 1 times [2022-04-28 04:10:06,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:06,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612987480] [2022-04-28 04:10:06,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:06,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:06,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:06,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11262#true} is VALID [2022-04-28 04:10:06,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {11262#true} assume true; {11262#true} is VALID [2022-04-28 04:10:06,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11262#true} {11262#true} #56#return; {11262#true} is VALID [2022-04-28 04:10:06,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {11262#true} call ULTIMATE.init(); {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:06,677 INFO L290 TraceCheckUtils]: 1: Hoare triple {11268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11262#true} is VALID [2022-04-28 04:10:06,677 INFO L290 TraceCheckUtils]: 2: Hoare triple {11262#true} assume true; {11262#true} is VALID [2022-04-28 04:10:06,677 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11262#true} {11262#true} #56#return; {11262#true} is VALID [2022-04-28 04:10:06,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {11262#true} call #t~ret7 := main(); {11262#true} is VALID [2022-04-28 04:10:06,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {11262#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {11267#(= main_~a~0 0)} is VALID [2022-04-28 04:10:06,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {11267#(= main_~a~0 0)} [118] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_2065 v_main_~c~0_2036) (= v_main_~a~0_184 v_main_~a~0_183) (= |v_main_#t~pre6_1168| |v_main_#t~pre6_1144|) (= |v_main_#t~pre5_669| |v_main_#t~pre5_664|) (= v_main_~b~0_864 v_main_~b~0_858) (= |v_main_#t~pre4_149| |v_main_#t~pre4_148|)) InVars {main_~c~0=v_main_~c~0_2065, main_~b~0=v_main_~b~0_864, main_#t~pre4=|v_main_#t~pre4_149|, main_#t~pre5=|v_main_#t~pre5_669|, main_~a~0=v_main_~a~0_184, main_#t~pre6=|v_main_#t~pre6_1168|} OutVars{main_~c~0=v_main_~c~0_2036, main_~b~0=v_main_~b~0_858, main_#t~pre4=|v_main_#t~pre4_148|, main_#t~pre5=|v_main_#t~pre5_664|, main_~a~0=v_main_~a~0_183, main_#t~pre6=|v_main_#t~pre6_1144|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11267#(= main_~a~0 0)} is VALID [2022-04-28 04:10:06,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {11267#(= main_~a~0 0)} [117] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {11263#false} is VALID [2022-04-28 04:10:06,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {11263#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {11263#false} is VALID [2022-04-28 04:10:06,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {11263#false} assume !false; {11263#false} is VALID [2022-04-28 04:10:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:06,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:06,678 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612987480] [2022-04-28 04:10:06,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612987480] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:06,679 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:06,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:07,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:07,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1687806662] [2022-04-28 04:10:07,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1687806662] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:07,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:07,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-28 04:10:07,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611253552] [2022-04-28 04:10:07,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:07,507 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 04:10:07,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:07,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:07,556 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-28 04:10:07,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-28 04:10:07,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:07,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-28 04:10:07,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1085, Unknown=0, NotChecked=0, Total=1190 [2022-04-28 04:10:07,557 INFO L87 Difference]: Start difference. First operand 77 states and 79 transitions. Second operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,296 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2022-04-28 04:10:10,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-28 04:10:10,297 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 75 [2022-04-28 04:10:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:10,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2022-04-28 04:10:10,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 100 transitions. [2022-04-28 04:10:10,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 100 transitions. [2022-04-28 04:10:10,374 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-28 04:10:10,375 INFO L225 Difference]: With dead ends: 93 [2022-04-28 04:10:10,375 INFO L226 Difference]: Without dead ends: 84 [2022-04-28 04:10:10,376 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 25 SyntacticMatches, 18 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 885 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=309, Invalid=4113, Unknown=0, NotChecked=0, Total=4422 [2022-04-28 04:10:10,376 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 95 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1756 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:10,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 37 Invalid, 1830 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1756 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-04-28 04:10:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-04-28 04:10:10,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 78. [2022-04-28 04:10:10,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:10,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,405 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,405 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,406 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 04:10:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 04:10:10,406 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:10,406 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:10,406 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 04:10:10,407 INFO L87 Difference]: Start difference. First operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 84 states. [2022-04-28 04:10:10,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:10,408 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2022-04-28 04:10:10,408 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-28 04:10:10,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:10,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:10,408 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:10,408 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 74 states have internal predecessors, (77), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2022-04-28 04:10:10,409 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 75 [2022-04-28 04:10:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:10,409 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2022-04-28 04:10:10,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.057142857142857) internal successors, (72), 34 states have internal predecessors, (72), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:10,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 80 transitions. [2022-04-28 04:10:10,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:10,558 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2022-04-28 04:10:10,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 04:10:10,559 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:10,559 INFO L195 NwaCegarLoop]: trace histogram [25, 25, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:10,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-04-28 04:10:10,559 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:10,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:10,560 INFO L85 PathProgramCache]: Analyzing trace with hash 132809977, now seen corresponding path program 29 times [2022-04-28 04:10:10,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:10,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [977451168] [2022-04-28 04:10:14,770 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:14,818 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:14,905 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:17,089 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:17,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-28 04:10:17,223 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-28 04:10:17,230 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:17,230 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:17,381 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:17,381 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:17,382 INFO L85 PathProgramCache]: Analyzing trace with hash 1695845455, now seen corresponding path program 1 times [2022-04-28 04:10:17,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:17,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617147201] [2022-04-28 04:10:17,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:17,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:17,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:17,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:17,410 INFO L290 TraceCheckUtils]: 0: Hoare triple {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11876#true} is VALID [2022-04-28 04:10:17,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {11876#true} assume true; {11876#true} is VALID [2022-04-28 04:10:17,411 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11876#true} {11876#true} #56#return; {11876#true} is VALID [2022-04-28 04:10:17,411 INFO L272 TraceCheckUtils]: 0: Hoare triple {11876#true} call ULTIMATE.init(); {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:17,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {11882#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {11876#true} is VALID [2022-04-28 04:10:17,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {11876#true} assume true; {11876#true} is VALID [2022-04-28 04:10:17,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11876#true} {11876#true} #56#return; {11876#true} is VALID [2022-04-28 04:10:17,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {11876#true} call #t~ret7 := main(); {11876#true} is VALID [2022-04-28 04:10:17,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {11876#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {11881#(= main_~a~0 0)} is VALID [2022-04-28 04:10:17,413 INFO L290 TraceCheckUtils]: 6: Hoare triple {11881#(= main_~a~0 0)} [120] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre6_1223| |v_main_#t~pre6_1198|)) (.cse1 (= v_main_~b~0_903 v_main_~b~0_897)) (.cse2 (= |v_main_#t~pre5_698| |v_main_#t~pre5_693|)) (.cse3 (= v_main_~c~0_2171 v_main_~c~0_2141)) (.cse4 (= |v_main_#t~pre4_154| |v_main_#t~pre4_153|))) (or (and .cse0 .cse1 .cse2 .cse3 (= v_main_~a~0_190 v_main_~a~0_189) .cse4) (and .cse0 .cse1 (= v_main_~a~0_189 v_main_~a~0_190) .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_2171, main_~b~0=v_main_~b~0_903, main_#t~pre4=|v_main_#t~pre4_154|, main_#t~pre5=|v_main_#t~pre5_698|, main_~a~0=v_main_~a~0_190, main_#t~pre6=|v_main_#t~pre6_1223|} OutVars{main_~c~0=v_main_~c~0_2141, main_~b~0=v_main_~b~0_897, main_#t~pre4=|v_main_#t~pre4_153|, main_#t~pre5=|v_main_#t~pre5_693|, main_~a~0=v_main_~a~0_189, main_#t~pre6=|v_main_#t~pre6_1198|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {11881#(= main_~a~0 0)} is VALID [2022-04-28 04:10:17,413 INFO L290 TraceCheckUtils]: 7: Hoare triple {11881#(= main_~a~0 0)} [119] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {11877#false} is VALID [2022-04-28 04:10:17,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {11877#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {11877#false} is VALID [2022-04-28 04:10:17,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {11877#false} assume !false; {11877#false} is VALID [2022-04-28 04:10:17,414 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:17,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:17,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617147201] [2022-04-28 04:10:17,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617147201] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:17,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:17,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:18,233 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:18,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [977451168] [2022-04-28 04:10:18,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [977451168] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:18,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:18,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-28 04:10:18,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949289423] [2022-04-28 04:10:18,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 04:10:18,234 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:18,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:18,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:18,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-28 04:10:18,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:18,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-28 04:10:18,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=1152, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 04:10:18,286 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:21,545 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2022-04-28 04:10:21,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 04:10:21,545 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 77 [2022-04-28 04:10:21,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:21,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-28 04:10:21,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 102 transitions. [2022-04-28 04:10:21,548 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 102 transitions. [2022-04-28 04:10:21,626 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-28 04:10:21,628 INFO L225 Difference]: With dead ends: 95 [2022-04-28 04:10:21,628 INFO L226 Difference]: Without dead ends: 86 [2022-04-28 04:10:21,629 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 27 SyntacticMatches, 17 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 923 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=4374, Unknown=0, NotChecked=0, Total=4692 [2022-04-28 04:10:21,629 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 96 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 2142 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:21,629 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 107 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2142 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-04-28 04:10:21,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-28 04:10:21,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 80. [2022-04-28 04:10:21,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:21,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,659 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,659 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:21,660 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-28 04:10:21,660 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 04:10:21,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:21,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:21,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 04:10:21,661 INFO L87 Difference]: Start difference. First operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 86 states. [2022-04-28 04:10:21,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:21,661 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-04-28 04:10:21,662 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-28 04:10:21,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:21,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:21,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:21,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:21,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 76 states have (on average 1.0394736842105263) internal successors, (79), 76 states have internal predecessors, (79), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 82 transitions. [2022-04-28 04:10:21,663 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 82 transitions. Word has length 77 [2022-04-28 04:10:21,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:21,663 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 82 transitions. [2022-04-28 04:10:21,664 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 35 states have internal predecessors, (74), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:21,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 82 transitions. [2022-04-28 04:10:21,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:21,823 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 82 transitions. [2022-04-28 04:10:21,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-28 04:10:21,823 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:21,823 INFO L195 NwaCegarLoop]: trace histogram [26, 26, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:21,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-04-28 04:10:21,823 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:21,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:21,824 INFO L85 PathProgramCache]: Analyzing trace with hash -517123817, now seen corresponding path program 30 times [2022-04-28 04:10:21,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:21,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [437586135] [2022-04-28 04:10:22,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:22,118 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:22,248 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:22,332 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:22,378 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-28 04:10:22,490 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-28 04:10:22,661 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:22,662 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:22,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1695906959, now seen corresponding path program 1 times [2022-04-28 04:10:22,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:22,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218384131] [2022-04-28 04:10:22,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:22,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:22,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:22,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12505#true} is VALID [2022-04-28 04:10:22,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {12505#true} assume true; {12505#true} is VALID [2022-04-28 04:10:22,701 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12505#true} {12505#true} #56#return; {12505#true} is VALID [2022-04-28 04:10:22,702 INFO L272 TraceCheckUtils]: 0: Hoare triple {12505#true} call ULTIMATE.init(); {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:22,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {12511#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {12505#true} is VALID [2022-04-28 04:10:22,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {12505#true} assume true; {12505#true} is VALID [2022-04-28 04:10:22,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12505#true} {12505#true} #56#return; {12505#true} is VALID [2022-04-28 04:10:22,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {12505#true} call #t~ret7 := main(); {12505#true} is VALID [2022-04-28 04:10:22,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {12505#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {12510#(= main_~a~0 0)} is VALID [2022-04-28 04:10:22,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {12510#(= main_~a~0 0)} [122] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_731| |v_main_#t~pre5_726|) (= v_main_~b~0_945 v_main_~b~0_939) (= |v_main_#t~pre4_159| |v_main_#t~pre4_158|) (= v_main_~c~0_2284 v_main_~c~0_2253) (= v_main_~a~0_196 v_main_~a~0_195) (= |v_main_#t~pre6_1284| |v_main_#t~pre6_1258|)) InVars {main_~c~0=v_main_~c~0_2284, main_~b~0=v_main_~b~0_945, main_#t~pre4=|v_main_#t~pre4_159|, main_#t~pre5=|v_main_#t~pre5_731|, main_~a~0=v_main_~a~0_196, main_#t~pre6=|v_main_#t~pre6_1284|} OutVars{main_~c~0=v_main_~c~0_2253, main_~b~0=v_main_~b~0_939, main_#t~pre4=|v_main_#t~pre4_158|, main_#t~pre5=|v_main_#t~pre5_726|, main_~a~0=v_main_~a~0_195, main_#t~pre6=|v_main_#t~pre6_1258|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {12510#(= main_~a~0 0)} is VALID [2022-04-28 04:10:22,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {12510#(= main_~a~0 0)} [121] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {12506#false} is VALID [2022-04-28 04:10:22,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {12506#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {12506#false} is VALID [2022-04-28 04:10:22,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {12506#false} assume !false; {12506#false} is VALID [2022-04-28 04:10:22,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:22,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:22,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218384131] [2022-04-28 04:10:22,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218384131] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:22,704 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:22,704 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:23,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:23,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [437586135] [2022-04-28 04:10:23,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [437586135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:23,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:23,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-28 04:10:23,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379722801] [2022-04-28 04:10:23,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:23,491 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-28 04:10:23,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:23,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:23,547 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-28 04:10:23,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-28 04:10:23,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:23,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-28 04:10:23,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1221, Unknown=0, NotChecked=0, Total=1332 [2022-04-28 04:10:23,548 INFO L87 Difference]: Start difference. First operand 80 states and 82 transitions. Second operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,115 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2022-04-28 04:10:27,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-28 04:10:27,116 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 79 [2022-04-28 04:10:27,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:27,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2022-04-28 04:10:27,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 104 transitions. [2022-04-28 04:10:27,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 104 transitions. [2022-04-28 04:10:27,218 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-28 04:10:27,219 INFO L225 Difference]: With dead ends: 97 [2022-04-28 04:10:27,219 INFO L226 Difference]: Without dead ends: 88 [2022-04-28 04:10:27,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 36 SyntacticMatches, 9 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 920 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=327, Invalid=4643, Unknown=0, NotChecked=0, Total=4970 [2022-04-28 04:10:27,220 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 2417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:27,220 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 122 Invalid, 2417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:10:27,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-04-28 04:10:27,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 82. [2022-04-28 04:10:27,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:27,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,244 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,244 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,245 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-28 04:10:27,245 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-28 04:10:27,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 04:10:27,247 INFO L87 Difference]: Start difference. First operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 88 states. [2022-04-28 04:10:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:27,248 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-04-28 04:10:27,248 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-28 04:10:27,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:27,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:27,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:27,249 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 78 states have internal predecessors, (81), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2022-04-28 04:10:27,251 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 79 [2022-04-28 04:10:27,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:27,251 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2022-04-28 04:10:27,251 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.054054054054054) internal successors, (76), 36 states have internal predecessors, (76), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:27,251 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 84 transitions. [2022-04-28 04:10:27,386 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-28 04:10:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2022-04-28 04:10:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-28 04:10:27,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:27,386 INFO L195 NwaCegarLoop]: trace histogram [27, 27, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:27,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-04-28 04:10:27,386 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:27,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:27,387 INFO L85 PathProgramCache]: Analyzing trace with hash 1961725365, now seen corresponding path program 31 times [2022-04-28 04:10:27,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:27,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [658904592] [2022-04-28 04:10:27,592 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,679 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,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-28 04:10:27,880 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,930 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:27,937 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:27,937 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:28,112 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:28,113 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:28,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1695968463, now seen corresponding path program 1 times [2022-04-28 04:10:28,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:28,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288633459] [2022-04-28 04:10:28,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:28,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:28,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:28,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:28,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:28,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13149#true} is VALID [2022-04-28 04:10:28,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-28 04:10:28,152 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13149#true} {13149#true} #56#return; {13149#true} is VALID [2022-04-28 04:10:28,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {13149#true} call ULTIMATE.init(); {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:28,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {13155#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13149#true} is VALID [2022-04-28 04:10:28,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {13149#true} assume true; {13149#true} is VALID [2022-04-28 04:10:28,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13149#true} {13149#true} #56#return; {13149#true} is VALID [2022-04-28 04:10:28,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {13149#true} call #t~ret7 := main(); {13149#true} is VALID [2022-04-28 04:10:28,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {13149#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {13154#(= main_~a~0 0)} is VALID [2022-04-28 04:10:28,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {13154#(= main_~a~0 0)} [124] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_164| |v_main_#t~pre4_163|)) (.cse1 (= v_main_~b~0_984 v_main_~b~0_978)) (.cse2 (= v_main_~a~0_202 v_main_~a~0_201)) (.cse3 (= |v_main_#t~pre6_1343| |v_main_#t~pre6_1316|)) (.cse4 (= v_main_~c~0_2396 v_main_~c~0_2364))) (or (and .cse0 .cse1 .cse2 (= |v_main_#t~pre5_755| |v_main_#t~pre5_760|) .cse3 .cse4) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_760| |v_main_#t~pre5_755|) .cse4))) InVars {main_~c~0=v_main_~c~0_2396, main_~b~0=v_main_~b~0_984, main_#t~pre4=|v_main_#t~pre4_164|, main_#t~pre5=|v_main_#t~pre5_760|, main_~a~0=v_main_~a~0_202, main_#t~pre6=|v_main_#t~pre6_1343|} OutVars{main_~c~0=v_main_~c~0_2364, main_~b~0=v_main_~b~0_978, main_#t~pre4=|v_main_#t~pre4_163|, main_#t~pre5=|v_main_#t~pre5_755|, main_~a~0=v_main_~a~0_201, main_#t~pre6=|v_main_#t~pre6_1316|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13154#(= main_~a~0 0)} is VALID [2022-04-28 04:10:28,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {13154#(= main_~a~0 0)} [123] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {13150#false} is VALID [2022-04-28 04:10:28,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {13150#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {13150#false} is VALID [2022-04-28 04:10:28,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {13150#false} assume !false; {13150#false} is VALID [2022-04-28 04:10:28,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:28,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:28,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288633459] [2022-04-28 04:10:28,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288633459] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:28,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:28,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:29,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:29,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [658904592] [2022-04-28 04:10:29,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [658904592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:29,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:29,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-28 04:10:29,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504312798] [2022-04-28 04:10:29,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:29,116 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-28 04:10:29,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:29,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:29,171 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-28 04:10:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-28 04:10:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:29,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-28 04:10:29,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=1292, Unknown=0, NotChecked=0, Total=1406 [2022-04-28 04:10:29,172 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:32,737 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2022-04-28 04:10:32,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 04:10:32,737 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 81 [2022-04-28 04:10:32,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2022-04-28 04:10:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 106 transitions. [2022-04-28 04:10:32,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 106 transitions. [2022-04-28 04:10:32,823 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-28 04:10:32,823 INFO L225 Difference]: With dead ends: 99 [2022-04-28 04:10:32,823 INFO L226 Difference]: Without dead ends: 90 [2022-04-28 04:10:32,824 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 29 SyntacticMatches, 17 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=336, Invalid=4920, Unknown=0, NotChecked=0, Total=5256 [2022-04-28 04:10:32,824 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 101 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2382 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 2382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:32,825 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 77 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 2382 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-04-28 04:10:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-28 04:10:32,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 84. [2022-04-28 04:10:32,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:32,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,852 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,852 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:32,853 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-28 04:10:32,853 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-28 04:10:32,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:32,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:32,853 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 04:10:32,854 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 90 states. [2022-04-28 04:10:32,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:32,855 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-04-28 04:10:32,855 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-28 04:10:32,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:32,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:32,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:32,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:32,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 80 states have internal predecessors, (83), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 86 transitions. [2022-04-28 04:10:32,856 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 86 transitions. Word has length 81 [2022-04-28 04:10:32,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:32,856 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 86 transitions. [2022-04-28 04:10:32,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.0526315789473686) internal successors, (78), 37 states have internal predecessors, (78), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:32,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 86 transitions. [2022-04-28 04:10:32,998 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-28 04:10:32,998 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 86 transitions. [2022-04-28 04:10:32,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-28 04:10:32,998 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:32,999 INFO L195 NwaCegarLoop]: trace histogram [28, 28, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:32,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-04-28 04:10:32,999 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:32,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:32,999 INFO L85 PathProgramCache]: Analyzing trace with hash 428939987, now seen corresponding path program 32 times [2022-04-28 04:10:32,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:32,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1752805154] [2022-04-28 04:10:33,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,299 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,419 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,510 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,557 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-28 04:10:33,693 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-28 04:10:33,868 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:33,868 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1696029967, now seen corresponding path program 1 times [2022-04-28 04:10:33,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:33,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461272975] [2022-04-28 04:10:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:33,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:33,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:33,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13808#true} is VALID [2022-04-28 04:10:33,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-28 04:10:33,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13808#true} {13808#true} #56#return; {13808#true} is VALID [2022-04-28 04:10:33,901 INFO L272 TraceCheckUtils]: 0: Hoare triple {13808#true} call ULTIMATE.init(); {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:33,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {13814#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {13808#true} is VALID [2022-04-28 04:10:33,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {13808#true} assume true; {13808#true} is VALID [2022-04-28 04:10:33,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13808#true} {13808#true} #56#return; {13808#true} is VALID [2022-04-28 04:10:33,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {13808#true} call #t~ret7 := main(); {13808#true} is VALID [2022-04-28 04:10:33,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {13808#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {13813#(= main_~a~0 0)} is VALID [2022-04-28 04:10:33,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {13813#(= main_~a~0 0)} [126] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~c~0_2515 v_main_~c~0_2482)) (.cse1 (= |v_main_#t~pre4_169| |v_main_#t~pre4_168|)) (.cse2 (= |v_main_#t~pre5_793| |v_main_#t~pre5_788|)) (.cse3 (= v_main_~b~0_1026 v_main_~b~0_1020)) (.cse4 (= v_main_~a~0_208 v_main_~a~0_207))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1380| |v_main_#t~pre6_1408|)) (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre6_1408| |v_main_#t~pre6_1380|)))) InVars {main_~c~0=v_main_~c~0_2515, main_~b~0=v_main_~b~0_1026, main_#t~pre4=|v_main_#t~pre4_169|, main_#t~pre5=|v_main_#t~pre5_793|, main_~a~0=v_main_~a~0_208, main_#t~pre6=|v_main_#t~pre6_1408|} OutVars{main_~c~0=v_main_~c~0_2482, main_~b~0=v_main_~b~0_1020, main_#t~pre4=|v_main_#t~pre4_168|, main_#t~pre5=|v_main_#t~pre5_788|, main_~a~0=v_main_~a~0_207, main_#t~pre6=|v_main_#t~pre6_1380|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {13813#(= main_~a~0 0)} is VALID [2022-04-28 04:10:33,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {13813#(= main_~a~0 0)} [125] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {13809#false} is VALID [2022-04-28 04:10:33,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {13809#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {13809#false} is VALID [2022-04-28 04:10:33,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {13809#false} assume !false; {13809#false} is VALID [2022-04-28 04:10:33,904 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:33,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:33,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461272975] [2022-04-28 04:10:33,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461272975] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:33,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:33,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:34,894 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:34,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1752805154] [2022-04-28 04:10:34,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1752805154] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:34,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:34,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-28 04:10:34,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589508050] [2022-04-28 04:10:34,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:34,895 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 04:10:34,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:34,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:34,951 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-28 04:10:34,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-28 04:10:34,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:34,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-28 04:10:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1365, Unknown=0, NotChecked=0, Total=1482 [2022-04-28 04:10:34,952 INFO L87 Difference]: Start difference. First operand 84 states and 86 transitions. Second operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:38,659 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2022-04-28 04:10:38,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-28 04:10:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 83 [2022-04-28 04:10:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:38,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2022-04-28 04:10:38,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 108 transitions. [2022-04-28 04:10:38,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 108 transitions. [2022-04-28 04:10:38,743 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-28 04:10:38,744 INFO L225 Difference]: With dead ends: 101 [2022-04-28 04:10:38,744 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 04:10:38,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 31 SyntacticMatches, 16 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1057 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=345, Invalid=5205, Unknown=0, NotChecked=0, Total=5550 [2022-04-28 04:10:38,745 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 94 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 2416 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 2416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:38,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 167 Invalid, 2492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 2416 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 04:10:38,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 04:10:38,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 86. [2022-04-28 04:10:38,770 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:38,771 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,771 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,771 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:38,772 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 04:10:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-28 04:10:38,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:38,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:38,773 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 04:10:38,773 INFO L87 Difference]: Start difference. First operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 92 states. [2022-04-28 04:10:38,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:38,774 INFO L93 Difference]: Finished difference Result 92 states and 96 transitions. [2022-04-28 04:10:38,774 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-28 04:10:38,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:38,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:38,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:38,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:38,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 82 states have internal predecessors, (85), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 88 transitions. [2022-04-28 04:10:38,775 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 88 transitions. Word has length 83 [2022-04-28 04:10:38,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:38,776 INFO L495 AbstractCegarLoop]: Abstraction has 86 states and 88 transitions. [2022-04-28 04:10:38,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.051282051282051) internal successors, (80), 38 states have internal predecessors, (80), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:38,776 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 88 transitions. [2022-04-28 04:10:38,929 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-28 04:10:38,929 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 88 transitions. [2022-04-28 04:10:38,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-28 04:10:38,930 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:38,930 INFO L195 NwaCegarLoop]: trace histogram [29, 29, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:38,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-04-28 04:10:38,930 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:38,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:38,930 INFO L85 PathProgramCache]: Analyzing trace with hash 595974257, now seen corresponding path program 33 times [2022-04-28 04:10:38,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:38,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [876667147] [2022-04-28 04:10:39,264 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:39,351 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:43,438 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:43,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-28 04:10:43,579 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10: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-28 04:10:43,634 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:43,634 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:43,800 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:43,800 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:43,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1696091471, now seen corresponding path program 1 times [2022-04-28 04:10:43,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:43,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051899355] [2022-04-28 04:10:43,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:43,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:43,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:43,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:43,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:43,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14482#true} is VALID [2022-04-28 04:10:43,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-28 04:10:43,833 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14482#true} {14482#true} #56#return; {14482#true} is VALID [2022-04-28 04:10:43,834 INFO L272 TraceCheckUtils]: 0: Hoare triple {14482#true} call ULTIMATE.init(); {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:43,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {14488#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {14482#true} is VALID [2022-04-28 04:10:43,834 INFO L290 TraceCheckUtils]: 2: Hoare triple {14482#true} assume true; {14482#true} is VALID [2022-04-28 04:10:43,834 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14482#true} {14482#true} #56#return; {14482#true} is VALID [2022-04-28 04:10:43,834 INFO L272 TraceCheckUtils]: 4: Hoare triple {14482#true} call #t~ret7 := main(); {14482#true} is VALID [2022-04-28 04:10:43,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {14482#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {14487#(= main_~a~0 0)} is VALID [2022-04-28 04:10:43,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {14487#(= main_~a~0 0)} [128] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_1065 v_main_~b~0_1059)) (.cse1 (= |v_main_#t~pre6_1471| |v_main_#t~pre6_1442|)) (.cse2 (= v_main_~a~0_214 v_main_~a~0_213)) (.cse3 (= v_main_~c~0_2633 v_main_~c~0_2599))) (or (and .cse0 (= |v_main_#t~pre5_817| |v_main_#t~pre5_822|) .cse1 (= |v_main_#t~pre4_173| |v_main_#t~pre4_174|) .cse2 .cse3) (and .cse0 (= |v_main_#t~pre5_822| |v_main_#t~pre5_817|) .cse1 .cse2 .cse3 (= |v_main_#t~pre4_174| |v_main_#t~pre4_173|)))) InVars {main_~c~0=v_main_~c~0_2633, main_~b~0=v_main_~b~0_1065, main_#t~pre4=|v_main_#t~pre4_174|, main_#t~pre5=|v_main_#t~pre5_822|, main_~a~0=v_main_~a~0_214, main_#t~pre6=|v_main_#t~pre6_1471|} OutVars{main_~c~0=v_main_~c~0_2599, main_~b~0=v_main_~b~0_1059, main_#t~pre4=|v_main_#t~pre4_173|, main_#t~pre5=|v_main_#t~pre5_817|, main_~a~0=v_main_~a~0_213, main_#t~pre6=|v_main_#t~pre6_1442|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {14487#(= main_~a~0 0)} is VALID [2022-04-28 04:10:43,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {14487#(= main_~a~0 0)} [127] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {14483#false} is VALID [2022-04-28 04:10:43,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {14483#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {14483#false} is VALID [2022-04-28 04:10:43,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {14483#false} assume !false; {14483#false} is VALID [2022-04-28 04:10:43,836 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:43,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:43,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051899355] [2022-04-28 04:10:43,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051899355] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:43,836 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:43,836 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:44,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:44,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [876667147] [2022-04-28 04:10:44,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [876667147] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:44,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:44,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-28 04:10:44,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381500701] [2022-04-28 04:10:44,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:44,913 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 04:10:44,913 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:44,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:44,983 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-28 04:10:44,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-28 04:10:44,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:44,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-28 04:10:44,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2022-04-28 04:10:44,984 INFO L87 Difference]: Start difference. First operand 86 states and 88 transitions. Second operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:48,740 INFO L93 Difference]: Finished difference Result 105 states and 113 transitions. [2022-04-28 04:10:48,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 04:10:48,741 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 85 [2022-04-28 04:10:48,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:48,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 113 transitions. [2022-04-28 04:10:48,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 113 transitions. [2022-04-28 04:10:48,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 113 transitions. [2022-04-28 04:10:48,828 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-28 04:10:48,828 INFO L225 Difference]: With dead ends: 105 [2022-04-28 04:10:48,829 INFO L226 Difference]: Without dead ends: 96 [2022-04-28 04:10:48,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 28 SyntacticMatches, 20 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1127 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=354, Invalid=5498, Unknown=0, NotChecked=0, Total=5852 [2022-04-28 04:10:48,829 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:48,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 157 Invalid, 2561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-04-28 04:10:48,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-04-28 04:10:48,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 90. [2022-04-28 04:10:48,854 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:48,854 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,854 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,854 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:48,855 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 04:10:48,855 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 04:10:48,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:48,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:48,855 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 04:10:48,856 INFO L87 Difference]: Start difference. First operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 96 states. [2022-04-28 04:10:48,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:48,857 INFO L93 Difference]: Finished difference Result 96 states and 100 transitions. [2022-04-28 04:10:48,857 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-28 04:10:48,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:48,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:48,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:48,857 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:48,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 86 states have (on average 1.0348837209302326) internal successors, (89), 86 states have internal predecessors, (89), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2022-04-28 04:10:48,858 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 85 [2022-04-28 04:10:48,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:48,859 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2022-04-28 04:10:48,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.05) internal successors, (82), 39 states have internal predecessors, (82), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:48,859 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 92 transitions. [2022-04-28 04:10:49,030 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-28 04:10:49,031 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2022-04-28 04:10:49,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-28 04:10:49,031 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:49,031 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:49,031 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-04-28 04:10:49,032 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:49,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:49,032 INFO L85 PathProgramCache]: Analyzing trace with hash -2092849521, now seen corresponding path program 34 times [2022-04-28 04:10:49,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:49,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1688708618] [2022-04-28 04:10:51,224 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:51,276 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:51,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:54,158 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:10:54,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-28 04:10:54,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-28 04:10:54,323 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:10:54,324 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:10:54,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:10:54,503 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:10:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1696152975, now seen corresponding path program 1 times [2022-04-28 04:10:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:10:54,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489822666] [2022-04-28 04:10:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:10:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:10:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:54,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:10:54,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:10:54,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15183#true} is VALID [2022-04-28 04:10:54,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {15183#true} assume true; {15183#true} is VALID [2022-04-28 04:10:54,531 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15183#true} {15183#true} #56#return; {15183#true} is VALID [2022-04-28 04:10:54,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {15183#true} call ULTIMATE.init(); {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:10:54,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {15189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15183#true} is VALID [2022-04-28 04:10:54,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {15183#true} assume true; {15183#true} is VALID [2022-04-28 04:10:54,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15183#true} {15183#true} #56#return; {15183#true} is VALID [2022-04-28 04:10:54,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {15183#true} call #t~ret7 := main(); {15183#true} is VALID [2022-04-28 04:10:54,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {15183#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {15188#(= main_~a~0 0)} is VALID [2022-04-28 04:10:54,533 INFO L290 TraceCheckUtils]: 6: Hoare triple {15188#(= main_~a~0 0)} [130] L21-3-->L21-4_primed: Formula: (and (= v_main_~c~0_2742 v_main_~c~0_2707) (= |v_main_#t~pre5_845| |v_main_#t~pre5_840|) (= |v_main_#t~pre6_1525| |v_main_#t~pre6_1495|) (= v_main_~b~0_1097 v_main_~b~0_1091) (= |v_main_#t~pre4_179| |v_main_#t~pre4_178|) (= v_main_~a~0_220 v_main_~a~0_219)) InVars {main_~c~0=v_main_~c~0_2742, main_~b~0=v_main_~b~0_1097, main_#t~pre4=|v_main_#t~pre4_179|, main_#t~pre5=|v_main_#t~pre5_845|, main_~a~0=v_main_~a~0_220, main_#t~pre6=|v_main_#t~pre6_1525|} OutVars{main_~c~0=v_main_~c~0_2707, main_~b~0=v_main_~b~0_1091, main_#t~pre4=|v_main_#t~pre4_178|, main_#t~pre5=|v_main_#t~pre5_840|, main_~a~0=v_main_~a~0_219, main_#t~pre6=|v_main_#t~pre6_1495|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15188#(= main_~a~0 0)} is VALID [2022-04-28 04:10:54,533 INFO L290 TraceCheckUtils]: 7: Hoare triple {15188#(= main_~a~0 0)} [129] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {15184#false} is VALID [2022-04-28 04:10:54,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {15184#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {15184#false} is VALID [2022-04-28 04:10:54,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {15184#false} assume !false; {15184#false} is VALID [2022-04-28 04:10:54,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:10:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:10:54,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489822666] [2022-04-28 04:10:54,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489822666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:54,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:54,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:10:55,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:10:55,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1688708618] [2022-04-28 04:10:55,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1688708618] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:10:55,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:10:55,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-28 04:10:55,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030039453] [2022-04-28 04:10:55,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:10:55,630 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 04:10:55,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:10:55,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:55,690 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:10:55,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-28 04:10:55,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:55,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-28 04:10:55,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1517, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 04:10:55,690 INFO L87 Difference]: Start difference. First operand 90 states and 92 transitions. Second operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:59,632 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2022-04-28 04:10:59,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-28 04:10:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 87 [2022-04-28 04:10:59,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:10:59,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 113 transitions. [2022-04-28 04:10:59,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 113 transitions. [2022-04-28 04:10:59,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 113 transitions. [2022-04-28 04:10:59,722 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-28 04:10:59,723 INFO L225 Difference]: With dead ends: 106 [2022-04-28 04:10:59,723 INFO L226 Difference]: Without dead ends: 97 [2022-04-28 04:10:59,724 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 32 SyntacticMatches, 17 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1177 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=363, Invalid=5799, Unknown=0, NotChecked=0, Total=6162 [2022-04-28 04:10:59,724 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 98 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 2604 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 2686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 2604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-04-28 04:10:59,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 97 Invalid, 2686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 2604 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-04-28 04:10:59,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-28 04:10:59,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 92. [2022-04-28 04:10:59,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:10:59,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,760 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,760 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:59,761 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-28 04:10:59,761 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-28 04:10:59,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:59,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:59,761 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 04:10:59,761 INFO L87 Difference]: Start difference. First operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 97 states. [2022-04-28 04:10:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:10:59,762 INFO L93 Difference]: Finished difference Result 97 states and 101 transitions. [2022-04-28 04:10:59,762 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 101 transitions. [2022-04-28 04:10:59,762 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:10:59,762 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:10:59,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:10:59,763 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:10:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 88 states have (on average 1.0340909090909092) internal successors, (91), 88 states have internal predecessors, (91), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 94 transitions. [2022-04-28 04:10:59,764 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 94 transitions. Word has length 87 [2022-04-28 04:10:59,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:10:59,764 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 94 transitions. [2022-04-28 04:10:59,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.048780487804878) internal successors, (84), 40 states have internal predecessors, (84), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:10:59,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 94 transitions. [2022-04-28 04:10:59,927 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-28 04:10:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 94 transitions. [2022-04-28 04:10:59,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-28 04:10:59,927 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:10:59,927 INFO L195 NwaCegarLoop]: trace histogram [30, 30, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:10:59,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-04-28 04:10:59,927 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:10:59,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:10:59,928 INFO L85 PathProgramCache]: Analyzing trace with hash -246406746, now seen corresponding path program 35 times [2022-04-28 04:10:59,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:10:59,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [889660565] [2022-04-28 04:11:00,130 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:00,218 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:00,334 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:00,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:00,444 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:00,444 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:00,479 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-28 04:11:00,635 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:00,636 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:00,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1696214479, now seen corresponding path program 1 times [2022-04-28 04:11:00,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:00,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1786057748] [2022-04-28 04:11:00,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:00,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:00,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:00,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:00,669 INFO L290 TraceCheckUtils]: 0: Hoare triple {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15895#true} is VALID [2022-04-28 04:11:00,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {15895#true} assume true; {15895#true} is VALID [2022-04-28 04:11:00,669 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15895#true} {15895#true} #56#return; {15895#true} is VALID [2022-04-28 04:11:00,670 INFO L272 TraceCheckUtils]: 0: Hoare triple {15895#true} call ULTIMATE.init(); {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:00,670 INFO L290 TraceCheckUtils]: 1: Hoare triple {15901#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {15895#true} is VALID [2022-04-28 04:11:00,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {15895#true} assume true; {15895#true} is VALID [2022-04-28 04:11:00,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15895#true} {15895#true} #56#return; {15895#true} is VALID [2022-04-28 04:11:00,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {15895#true} call #t~ret7 := main(); {15895#true} is VALID [2022-04-28 04:11:00,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {15895#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {15900#(= main_~a~0 0)} is VALID [2022-04-28 04:11:00,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {15900#(= main_~a~0 0)} [132] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_226 v_main_~a~0_225)) (.cse1 (= |v_main_#t~pre6_1579| |v_main_#t~pre6_1549|)) (.cse2 (= |v_main_#t~pre5_875| |v_main_#t~pre5_869|)) (.cse3 (= |v_main_#t~pre4_184| |v_main_#t~pre4_183|)) (.cse4 (= v_main_~c~0_2859 v_main_~c~0_2823))) (or (and .cse0 (= v_main_~b~0_1131 v_main_~b~0_1138) .cse1 .cse2 .cse3 .cse4) (and .cse0 (= v_main_~b~0_1138 v_main_~b~0_1131) .cse1 .cse2 .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_2859, main_~b~0=v_main_~b~0_1138, main_#t~pre4=|v_main_#t~pre4_184|, main_#t~pre5=|v_main_#t~pre5_875|, main_~a~0=v_main_~a~0_226, main_#t~pre6=|v_main_#t~pre6_1579|} OutVars{main_~c~0=v_main_~c~0_2823, main_~b~0=v_main_~b~0_1131, main_#t~pre4=|v_main_#t~pre4_183|, main_#t~pre5=|v_main_#t~pre5_869|, main_~a~0=v_main_~a~0_225, main_#t~pre6=|v_main_#t~pre6_1549|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {15900#(= main_~a~0 0)} is VALID [2022-04-28 04:11:00,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {15900#(= main_~a~0 0)} [131] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {15896#false} is VALID [2022-04-28 04:11:00,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {15896#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {15896#false} is VALID [2022-04-28 04:11:00,673 INFO L290 TraceCheckUtils]: 9: Hoare triple {15896#false} assume !false; {15896#false} is VALID [2022-04-28 04:11:00,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:00,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:00,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1786057748] [2022-04-28 04:11:00,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1786057748] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:00,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:00,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:01,699 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:01,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [889660565] [2022-04-28 04:11:01,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [889660565] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:01,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:01,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-28 04:11:01,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397946433] [2022-04-28 04:11:01,700 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:01,700 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 04:11:01,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:01,701 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:01,762 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-28 04:11:01,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-28 04:11:01,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:01,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-28 04:11:01,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1596, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 04:11:01,763 INFO L87 Difference]: Start difference. First operand 92 states and 94 transitions. Second operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:06,587 INFO L93 Difference]: Finished difference Result 108 states and 115 transitions. [2022-04-28 04:11:06,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 04:11:06,587 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2022-04-28 04:11:06,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:06,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-04-28 04:11:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 115 transitions. [2022-04-28 04:11:06,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 115 transitions. [2022-04-28 04:11:06,681 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-28 04:11:06,682 INFO L225 Difference]: With dead ends: 108 [2022-04-28 04:11:06,682 INFO L226 Difference]: Without dead ends: 99 [2022-04-28 04:11:06,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 33 SyntacticMatches, 18 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1228 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=372, Invalid=6108, Unknown=0, NotChecked=0, Total=6480 [2022-04-28 04:11:06,683 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 108 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 3178 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 3268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 3178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:06,683 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 142 Invalid, 3268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 3178 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-04-28 04:11:06,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-28 04:11:06,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 93. [2022-04-28 04:11:06,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:06,713 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,713 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,713 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:06,714 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-28 04:11:06,714 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-28 04:11:06,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:06,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:06,715 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 04:11:06,715 INFO L87 Difference]: Start difference. First operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 99 states. [2022-04-28 04:11:06,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:06,716 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-04-28 04:11:06,716 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-04-28 04:11:06,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:06,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:06,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:06,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:06,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 89 states have internal predecessors, (92), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 95 transitions. [2022-04-28 04:11:06,717 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 95 transitions. Word has length 90 [2022-04-28 04:11:06,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:06,718 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 95 transitions. [2022-04-28 04:11:06,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0714285714285716) internal successors, (87), 41 states have internal predecessors, (87), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:06,718 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 95 transitions. [2022-04-28 04:11:06,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:11:06,883 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 95 transitions. [2022-04-28 04:11:06,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-04-28 04:11:06,884 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:06,884 INFO L195 NwaCegarLoop]: trace histogram [31, 31, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:06,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-04-28 04:11:06,884 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:06,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:06,884 INFO L85 PathProgramCache]: Analyzing trace with hash 127825540, now seen corresponding path program 36 times [2022-04-28 04:11:06,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:06,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1787407209] [2022-04-28 04:11:11,058 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:11,109 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:11,198 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,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-28 04:11:13,408 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,456 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-28 04:11:13,594 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-28 04:11:13,842 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:13,842 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:13,843 INFO L85 PathProgramCache]: Analyzing trace with hash 1696275983, now seen corresponding path program 1 times [2022-04-28 04:11:13,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:13,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121522539] [2022-04-28 04:11:13,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:13,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:13,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:13,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:13,870 INFO L290 TraceCheckUtils]: 0: Hoare triple {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16620#true} is VALID [2022-04-28 04:11:13,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {16620#true} assume true; {16620#true} is VALID [2022-04-28 04:11:13,871 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16620#true} {16620#true} #56#return; {16620#true} is VALID [2022-04-28 04:11:13,871 INFO L272 TraceCheckUtils]: 0: Hoare triple {16620#true} call ULTIMATE.init(); {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:13,871 INFO L290 TraceCheckUtils]: 1: Hoare triple {16626#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {16620#true} is VALID [2022-04-28 04:11:13,871 INFO L290 TraceCheckUtils]: 2: Hoare triple {16620#true} assume true; {16620#true} is VALID [2022-04-28 04:11:13,872 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16620#true} {16620#true} #56#return; {16620#true} is VALID [2022-04-28 04:11:13,872 INFO L272 TraceCheckUtils]: 4: Hoare triple {16620#true} call #t~ret7 := main(); {16620#true} is VALID [2022-04-28 04:11:13,872 INFO L290 TraceCheckUtils]: 5: Hoare triple {16620#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {16625#(= main_~a~0 0)} is VALID [2022-04-28 04:11:13,872 INFO L290 TraceCheckUtils]: 6: Hoare triple {16625#(= main_~a~0 0)} [134] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_1182 v_main_~b~0_1175) (= |v_main_#t~pre5_909| |v_main_#t~pre5_903|) (= v_main_~c~0_2983 v_main_~c~0_2946) (= v_main_~a~0_232 v_main_~a~0_231) (= |v_main_#t~pre4_189| |v_main_#t~pre4_188|) (= |v_main_#t~pre6_1644| |v_main_#t~pre6_1613|)) InVars {main_~c~0=v_main_~c~0_2983, main_~b~0=v_main_~b~0_1182, main_#t~pre4=|v_main_#t~pre4_189|, main_#t~pre5=|v_main_#t~pre5_909|, main_~a~0=v_main_~a~0_232, main_#t~pre6=|v_main_#t~pre6_1644|} OutVars{main_~c~0=v_main_~c~0_2946, main_~b~0=v_main_~b~0_1175, main_#t~pre4=|v_main_#t~pre4_188|, main_#t~pre5=|v_main_#t~pre5_903|, main_~a~0=v_main_~a~0_231, main_#t~pre6=|v_main_#t~pre6_1613|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {16625#(= main_~a~0 0)} is VALID [2022-04-28 04:11:13,873 INFO L290 TraceCheckUtils]: 7: Hoare triple {16625#(= main_~a~0 0)} [133] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {16621#false} is VALID [2022-04-28 04:11:13,873 INFO L290 TraceCheckUtils]: 8: Hoare triple {16621#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {16621#false} is VALID [2022-04-28 04:11:13,873 INFO L290 TraceCheckUtils]: 9: Hoare triple {16621#false} assume !false; {16621#false} is VALID [2022-04-28 04:11:13,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:13,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:13,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121522539] [2022-04-28 04:11:13,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121522539] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:13,874 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:13,874 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:15,070 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:15,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1787407209] [2022-04-28 04:11:15,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1787407209] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:15,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:15,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-28 04:11:15,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994468839] [2022-04-28 04:11:15,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:15,071 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 04:11:15,071 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:15,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:15,140 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-28 04:11:15,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-28 04:11:15,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:15,140 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-28 04:11:15,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1677, Unknown=0, NotChecked=0, Total=1806 [2022-04-28 04:11:15,141 INFO L87 Difference]: Start difference. First operand 93 states and 95 transitions. Second operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:19,833 INFO L93 Difference]: Finished difference Result 110 states and 117 transitions. [2022-04-28 04:11:19,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-28 04:11:19,833 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2022-04-28 04:11:19,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:19,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 117 transitions. [2022-04-28 04:11:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 117 transitions. [2022-04-28 04:11:19,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 117 transitions. [2022-04-28 04:11:19,922 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-28 04:11:19,923 INFO L225 Difference]: With dead ends: 110 [2022-04-28 04:11:19,923 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 04:11:19,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 30 SyntacticMatches, 22 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1308 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=381, Invalid=6425, Unknown=0, NotChecked=0, Total=6806 [2022-04-28 04:11:19,924 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 102 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3086 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 3086 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:19,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 167 Invalid, 3172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 3086 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-04-28 04:11:19,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 04:11:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 95. [2022-04-28 04:11:19,951 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:19,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,952 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,952 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:19,953 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-28 04:11:19,953 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 04:11:19,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:19,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:19,953 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 04:11:19,954 INFO L87 Difference]: Start difference. First operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 101 states. [2022-04-28 04:11:19,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:19,955 INFO L93 Difference]: Finished difference Result 101 states and 105 transitions. [2022-04-28 04:11:19,955 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 105 transitions. [2022-04-28 04:11:19,955 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:19,955 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:19,955 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:19,955 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:19,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 91 states have (on average 1.032967032967033) internal successors, (94), 91 states have internal predecessors, (94), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 97 transitions. [2022-04-28 04:11:19,956 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 97 transitions. Word has length 92 [2022-04-28 04:11:19,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:19,957 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 97 transitions. [2022-04-28 04:11:19,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.0697674418604652) internal successors, (89), 42 states have internal predecessors, (89), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:19,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 97 transitions. [2022-04-28 04:11:20,141 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-28 04:11:20,142 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 97 transitions. [2022-04-28 04:11:20,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-28 04:11:20,142 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:20,142 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:20,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-04-28 04:11:20,142 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:20,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:20,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1012200478, now seen corresponding path program 37 times [2022-04-28 04:11:20,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:20,143 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [8952232] [2022-04-28 04:11:20,370 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,459 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,573 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,665 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,713 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 4 HavocedVariables, 0 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:20,719 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:20,920 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:20,920 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:20,921 INFO L85 PathProgramCache]: Analyzing trace with hash 1696337487, now seen corresponding path program 1 times [2022-04-28 04:11:20,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:20,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205977163] [2022-04-28 04:11:20,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:20,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:20,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:20,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:20,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:20,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17360#true} is VALID [2022-04-28 04:11:20,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {17360#true} assume true; {17360#true} is VALID [2022-04-28 04:11:20,958 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17360#true} {17360#true} #56#return; {17360#true} is VALID [2022-04-28 04:11:20,959 INFO L272 TraceCheckUtils]: 0: Hoare triple {17360#true} call ULTIMATE.init(); {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:20,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {17366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {17360#true} is VALID [2022-04-28 04:11:20,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {17360#true} assume true; {17360#true} is VALID [2022-04-28 04:11:20,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17360#true} {17360#true} #56#return; {17360#true} is VALID [2022-04-28 04:11:20,959 INFO L272 TraceCheckUtils]: 4: Hoare triple {17360#true} call #t~ret7 := main(); {17360#true} is VALID [2022-04-28 04:11:20,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {17360#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {17365#(= main_~a~0 0)} is VALID [2022-04-28 04:11:20,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {17365#(= main_~a~0 0)} [136] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_238 v_main_~a~0_237)) (.cse1 (= |v_main_#t~pre4_194| |v_main_#t~pre4_193|)) (.cse2 (= v_main_~b~0_1223 v_main_~b~0_1216)) (.cse3 (= |v_main_#t~pre6_1707| |v_main_#t~pre6_1675|)) (.cse4 (= v_main_~c~0_3106 v_main_~c~0_3068))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= |v_main_#t~pre5_939| |v_main_#t~pre5_933|)) (and .cse0 .cse1 .cse2 .cse3 (= |v_main_#t~pre5_933| |v_main_#t~pre5_939|) .cse4))) InVars {main_~c~0=v_main_~c~0_3106, main_~b~0=v_main_~b~0_1223, main_#t~pre4=|v_main_#t~pre4_194|, main_#t~pre5=|v_main_#t~pre5_939|, main_~a~0=v_main_~a~0_238, main_#t~pre6=|v_main_#t~pre6_1707|} OutVars{main_~c~0=v_main_~c~0_3068, main_~b~0=v_main_~b~0_1216, main_#t~pre4=|v_main_#t~pre4_193|, main_#t~pre5=|v_main_#t~pre5_933|, main_~a~0=v_main_~a~0_237, main_#t~pre6=|v_main_#t~pre6_1675|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {17365#(= main_~a~0 0)} is VALID [2022-04-28 04:11:20,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {17365#(= main_~a~0 0)} [135] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {17361#false} is VALID [2022-04-28 04:11:20,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {17361#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {17361#false} is VALID [2022-04-28 04:11:20,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {17361#false} assume !false; {17361#false} is VALID [2022-04-28 04:11:20,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:20,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:20,964 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205977163] [2022-04-28 04:11:20,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205977163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:20,964 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:20,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:22,223 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:22,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [8952232] [2022-04-28 04:11:22,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [8952232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:22,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:22,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-28 04:11:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275801587] [2022-04-28 04:11:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:22,224 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 04:11:22,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:22,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:22,290 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-28 04:11:22,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-28 04:11:22,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:22,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-28 04:11:22,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1760, Unknown=0, NotChecked=0, Total=1892 [2022-04-28 04:11:22,290 INFO L87 Difference]: Start difference. First operand 95 states and 97 transitions. Second operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,242 INFO L93 Difference]: Finished difference Result 112 states and 119 transitions. [2022-04-28 04:11:27,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-28 04:11:27,242 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 94 [2022-04-28 04:11:27,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 119 transitions. [2022-04-28 04:11:27,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 119 transitions. [2022-04-28 04:11:27,244 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 119 transitions. [2022-04-28 04:11:27,331 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-28 04:11:27,332 INFO L225 Difference]: With dead ends: 112 [2022-04-28 04:11:27,332 INFO L226 Difference]: Without dead ends: 103 [2022-04-28 04:11:27,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 28 SyntacticMatches, 25 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1368 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=390, Invalid=6750, Unknown=0, NotChecked=0, Total=7140 [2022-04-28 04:11:27,333 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 112 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 3310 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 3310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:27,333 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 167 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 3310 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-04-28 04:11:27,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-04-28 04:11:27,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 97. [2022-04-28 04:11:27,361 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:27,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,362 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,362 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,362 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-28 04:11:27,363 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 04:11:27,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:27,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:27,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 04:11:27,363 INFO L87 Difference]: Start difference. First operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 103 states. [2022-04-28 04:11:27,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:27,364 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-04-28 04:11:27,364 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-04-28 04:11:27,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:27,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:27,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:27,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:27,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 93 states have (on average 1.032258064516129) internal successors, (96), 93 states have internal predecessors, (96), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 99 transitions. [2022-04-28 04:11:27,366 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 99 transitions. Word has length 94 [2022-04-28 04:11:27,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:27,366 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 99 transitions. [2022-04-28 04:11:27,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 43 states have internal predecessors, (91), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:27,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 99 transitions. [2022-04-28 04:11:27,539 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-28 04:11:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 99 transitions. [2022-04-28 04:11:27,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-04-28 04:11:27,540 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:27,540 INFO L195 NwaCegarLoop]: trace histogram [33, 33, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:27,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-04-28 04:11:27,540 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:27,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:27,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1360543296, now seen corresponding path program 38 times [2022-04-28 04:11:27,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:27,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [762028192] [2022-04-28 04:11:30,583 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:30,626 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:30,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-28 04:11:34,795 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:11:34,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-28 04:11:34,931 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:34,979 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-28 04:11:34,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:34,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:35,151 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:35,152 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:35,152 INFO L85 PathProgramCache]: Analyzing trace with hash 1696398991, now seen corresponding path program 1 times [2022-04-28 04:11:35,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:35,153 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233954037] [2022-04-28 04:11:35,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:35,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:35,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:35,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:35,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:35,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18115#true} is VALID [2022-04-28 04:11:35,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {18115#true} assume true; {18115#true} is VALID [2022-04-28 04:11:35,184 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18115#true} {18115#true} #56#return; {18115#true} is VALID [2022-04-28 04:11:35,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {18115#true} call ULTIMATE.init(); {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:35,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {18121#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18115#true} is VALID [2022-04-28 04:11:35,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {18115#true} assume true; {18115#true} is VALID [2022-04-28 04:11:35,185 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18115#true} {18115#true} #56#return; {18115#true} is VALID [2022-04-28 04:11:35,185 INFO L272 TraceCheckUtils]: 4: Hoare triple {18115#true} call #t~ret7 := main(); {18115#true} is VALID [2022-04-28 04:11:35,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {18115#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {18120#(= main_~a~0 0)} is VALID [2022-04-28 04:11:35,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {18120#(= main_~a~0 0)} [138] L21-3-->L21-4_primed: Formula: (and (= v_main_~b~0_1264 v_main_~b~0_1257) (= |v_main_#t~pre4_199| |v_main_#t~pre4_198|) (= |v_main_#t~pre5_969| |v_main_#t~pre5_963|) (= v_main_~a~0_244 v_main_~a~0_243) (= |v_main_#t~pre6_1772| |v_main_#t~pre6_1739|) (= v_main_~c~0_3232 v_main_~c~0_3193)) InVars {main_~c~0=v_main_~c~0_3232, main_~b~0=v_main_~b~0_1264, main_#t~pre4=|v_main_#t~pre4_199|, main_#t~pre5=|v_main_#t~pre5_969|, main_~a~0=v_main_~a~0_244, main_#t~pre6=|v_main_#t~pre6_1772|} OutVars{main_~c~0=v_main_~c~0_3193, main_~b~0=v_main_~b~0_1257, main_#t~pre4=|v_main_#t~pre4_198|, main_#t~pre5=|v_main_#t~pre5_963|, main_~a~0=v_main_~a~0_243, main_#t~pre6=|v_main_#t~pre6_1739|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18120#(= main_~a~0 0)} is VALID [2022-04-28 04:11:35,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {18120#(= main_~a~0 0)} [137] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {18116#false} is VALID [2022-04-28 04:11:35,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {18116#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {18116#false} is VALID [2022-04-28 04:11:35,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {18116#false} assume !false; {18116#false} is VALID [2022-04-28 04:11:35,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:35,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:35,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233954037] [2022-04-28 04:11:35,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233954037] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:35,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:35,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:36,681 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:36,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [762028192] [2022-04-28 04:11:36,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [762028192] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:36,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:36,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-28 04:11:36,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874648970] [2022-04-28 04:11:36,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:36,682 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 04:11:36,683 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:36,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:36,749 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-28 04:11:36,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-28 04:11:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-28 04:11:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=1845, Unknown=0, NotChecked=0, Total=1980 [2022-04-28 04:11:36,750 INFO L87 Difference]: Start difference. First operand 97 states and 99 transitions. Second operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,064 INFO L93 Difference]: Finished difference Result 114 states and 121 transitions. [2022-04-28 04:11:42,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-28 04:11:42,064 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 96 [2022-04-28 04:11:42,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:42,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 121 transitions. [2022-04-28 04:11:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 121 transitions. [2022-04-28 04:11:42,065 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 121 transitions. [2022-04-28 04:11:42,159 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-28 04:11:42,160 INFO L225 Difference]: With dead ends: 114 [2022-04-28 04:11:42,160 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 04:11:42,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 25 SyntacticMatches, 29 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1450 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=399, Invalid=7083, Unknown=0, NotChecked=0, Total=7482 [2022-04-28 04:11:42,161 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 3583 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 3679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 3583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:42,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 37 Invalid, 3679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 3583 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-04-28 04:11:42,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 04:11:42,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 99. [2022-04-28 04:11:42,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:42,204 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,204 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,204 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,205 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-28 04:11:42,205 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-28 04:11:42,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:42,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:42,206 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-28 04:11:42,206 INFO L87 Difference]: Start difference. First operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-28 04:11:42,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:42,207 INFO L93 Difference]: Finished difference Result 105 states and 109 transitions. [2022-04-28 04:11:42,207 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 109 transitions. [2022-04-28 04:11:42,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:42,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:42,207 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:42,207 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:42,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 95 states have (on average 1.0315789473684212) internal successors, (98), 95 states have internal predecessors, (98), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 101 transitions. [2022-04-28 04:11:42,208 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 101 transitions. Word has length 96 [2022-04-28 04:11:42,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:42,209 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 101 transitions. [2022-04-28 04:11:42,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.066666666666667) internal successors, (93), 44 states have internal predecessors, (93), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:42,209 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 101 transitions. [2022-04-28 04:11:42,418 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-28 04:11:42,418 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 101 transitions. [2022-04-28 04:11:42,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-28 04:11:42,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:42,419 INFO L195 NwaCegarLoop]: trace histogram [34, 34, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:42,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-04-28 04:11:42,419 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:42,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:42,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1110542306, now seen corresponding path program 39 times [2022-04-28 04:11:42,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:42,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2040835110] [2022-04-28 04:11:43,399 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:43,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,215 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,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-28 04:11:46,347 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-28 04:11:46,354 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:46,354 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:46,555 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:46,555 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:46,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1696460495, now seen corresponding path program 1 times [2022-04-28 04:11:46,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:46,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842878759] [2022-04-28 04:11:46,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:46,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:46,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:46,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:46,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18885#true} is VALID [2022-04-28 04:11:46,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {18885#true} assume true; {18885#true} is VALID [2022-04-28 04:11:46,589 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18885#true} {18885#true} #56#return; {18885#true} is VALID [2022-04-28 04:11:46,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {18885#true} call ULTIMATE.init(); {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:46,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {18891#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {18885#true} is VALID [2022-04-28 04:11:46,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {18885#true} assume true; {18885#true} is VALID [2022-04-28 04:11:46,590 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18885#true} {18885#true} #56#return; {18885#true} is VALID [2022-04-28 04:11:46,590 INFO L272 TraceCheckUtils]: 4: Hoare triple {18885#true} call #t~ret7 := main(); {18885#true} is VALID [2022-04-28 04:11:46,591 INFO L290 TraceCheckUtils]: 5: Hoare triple {18885#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {18890#(= main_~a~0 0)} is VALID [2022-04-28 04:11:46,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {18890#(= main_~a~0 0)} [140] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre5_999| |v_main_#t~pre5_993|)) (.cse1 (= v_main_~c~0_3361 v_main_~c~0_3321)) (.cse2 (= |v_main_#t~pre6_1839| |v_main_#t~pre6_1805|)) (.cse3 (= v_main_~b~0_1305 v_main_~b~0_1298)) (.cse4 (= |v_main_#t~pre4_204| |v_main_#t~pre4_203|))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (= v_main_~a~0_250 v_main_~a~0_249)) (and .cse0 .cse1 .cse2 (= v_main_~a~0_249 v_main_~a~0_250) .cse3 .cse4))) InVars {main_~c~0=v_main_~c~0_3361, main_~b~0=v_main_~b~0_1305, main_#t~pre4=|v_main_#t~pre4_204|, main_#t~pre5=|v_main_#t~pre5_999|, main_~a~0=v_main_~a~0_250, main_#t~pre6=|v_main_#t~pre6_1839|} OutVars{main_~c~0=v_main_~c~0_3321, main_~b~0=v_main_~b~0_1298, main_#t~pre4=|v_main_#t~pre4_203|, main_#t~pre5=|v_main_#t~pre5_993|, main_~a~0=v_main_~a~0_249, main_#t~pre6=|v_main_#t~pre6_1805|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {18890#(= main_~a~0 0)} is VALID [2022-04-28 04:11:46,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {18890#(= main_~a~0 0)} [139] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {18886#false} is VALID [2022-04-28 04:11:46,592 INFO L290 TraceCheckUtils]: 8: Hoare triple {18886#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {18886#false} is VALID [2022-04-28 04:11:46,592 INFO L290 TraceCheckUtils]: 9: Hoare triple {18886#false} assume !false; {18886#false} is VALID [2022-04-28 04:11:46,592 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:46,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:46,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842878759] [2022-04-28 04:11:46,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842878759] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:46,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:46,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:47,848 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:47,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2040835110] [2022-04-28 04:11:47,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2040835110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:47,849 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:47,849 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-28 04:11:47,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584826513] [2022-04-28 04:11:47,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:47,849 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 04:11:47,850 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:47,850 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:47,918 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-28 04:11:47,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-28 04:11:47,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:47,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-28 04:11:47,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1932, Unknown=0, NotChecked=0, Total=2070 [2022-04-28 04:11:47,920 INFO L87 Difference]: Start difference. First operand 99 states and 101 transitions. Second operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:53,114 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-04-28 04:11:53,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-28 04:11:53,115 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 98 [2022-04-28 04:11:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:11:53,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 123 transitions. [2022-04-28 04:11:53,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 123 transitions. [2022-04-28 04:11:53,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 123 transitions. [2022-04-28 04:11:53,209 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-28 04:11:53,210 INFO L225 Difference]: With dead ends: 116 [2022-04-28 04:11:53,210 INFO L226 Difference]: Without dead ends: 107 [2022-04-28 04:11:53,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 36 SyntacticMatches, 19 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1449 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=408, Invalid=7424, Unknown=0, NotChecked=0, Total=7832 [2022-04-28 04:11:53,211 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 108 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 3509 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 3601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 3509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:11:53,212 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 192 Invalid, 3601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 3509 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-04-28 04:11:53,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-28 04:11:53,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 101. [2022-04-28 04:11:53,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:11:53,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,242 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,242 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:53,244 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-28 04:11:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-28 04:11:53,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:53,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:53,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 04:11:53,244 INFO L87 Difference]: Start difference. First operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 107 states. [2022-04-28 04:11:53,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:11:53,245 INFO L93 Difference]: Finished difference Result 107 states and 111 transitions. [2022-04-28 04:11:53,246 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 111 transitions. [2022-04-28 04:11:53,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:11:53,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:11:53,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:11:53,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:11:53,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 97 states have internal predecessors, (100), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 103 transitions. [2022-04-28 04:11:53,247 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 103 transitions. Word has length 98 [2022-04-28 04:11:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:11:53,247 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 103 transitions. [2022-04-28 04:11:53,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.0652173913043477) internal successors, (95), 45 states have internal predecessors, (95), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:53,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 103 transitions. [2022-04-28 04:11:53,459 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-28 04:11:53,459 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 103 transitions. [2022-04-28 04:11:53,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-04-28 04:11:53,460 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:11:53,460 INFO L195 NwaCegarLoop]: trace histogram [35, 35, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:11:53,460 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-04-28 04:11:53,460 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:11:53,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:11:53,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1377759492, now seen corresponding path program 40 times [2022-04-28 04:11:53,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:53,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [300424303] [2022-04-28 04:11:53,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-28 04:11:53,769 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:53,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-28 04:11:53,970 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:54,019 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-28 04:11:54,027 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:11:54,027 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:11:54,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:11:54,194 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:11:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash 1696521999, now seen corresponding path program 1 times [2022-04-28 04:11:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:11:54,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387216808] [2022-04-28 04:11:54,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:11:54,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:11:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:54,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:11:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:11:54,221 INFO L290 TraceCheckUtils]: 0: Hoare triple {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19670#true} is VALID [2022-04-28 04:11:54,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-04-28 04:11:54,221 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19670#true} {19670#true} #56#return; {19670#true} is VALID [2022-04-28 04:11:54,221 INFO L272 TraceCheckUtils]: 0: Hoare triple {19670#true} call ULTIMATE.init(); {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:11:54,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {19676#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19670#true} is VALID [2022-04-28 04:11:54,222 INFO L290 TraceCheckUtils]: 2: Hoare triple {19670#true} assume true; {19670#true} is VALID [2022-04-28 04:11:54,222 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19670#true} {19670#true} #56#return; {19670#true} is VALID [2022-04-28 04:11:54,222 INFO L272 TraceCheckUtils]: 4: Hoare triple {19670#true} call #t~ret7 := main(); {19670#true} is VALID [2022-04-28 04:11:54,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {19670#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {19675#(= main_~a~0 0)} is VALID [2022-04-28 04:11:54,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {19675#(= main_~a~0 0)} [142] L21-3-->L21-4_primed: Formula: (and (= |v_main_#t~pre5_1029| |v_main_#t~pre5_1023|) (= v_main_~a~0_256 v_main_~a~0_255) (= v_main_~b~0_1346 v_main_~b~0_1339) (= v_main_~c~0_3493 v_main_~c~0_3452) (= |v_main_#t~pre4_209| |v_main_#t~pre4_208|) (= |v_main_#t~pre6_1908| |v_main_#t~pre6_1873|)) InVars {main_~c~0=v_main_~c~0_3493, main_~b~0=v_main_~b~0_1346, main_#t~pre4=|v_main_#t~pre4_209|, main_#t~pre5=|v_main_#t~pre5_1029|, main_~a~0=v_main_~a~0_256, main_#t~pre6=|v_main_#t~pre6_1908|} OutVars{main_~c~0=v_main_~c~0_3452, main_~b~0=v_main_~b~0_1339, main_#t~pre4=|v_main_#t~pre4_208|, main_#t~pre5=|v_main_#t~pre5_1023|, main_~a~0=v_main_~a~0_255, main_#t~pre6=|v_main_#t~pre6_1873|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {19675#(= main_~a~0 0)} is VALID [2022-04-28 04:11:54,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {19675#(= main_~a~0 0)} [141] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {19671#false} is VALID [2022-04-28 04:11:54,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {19671#false} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {19671#false} is VALID [2022-04-28 04:11:54,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {19671#false} assume !false; {19671#false} is VALID [2022-04-28 04:11:54,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:11:54,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:11:54,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387216808] [2022-04-28 04:11:54,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387216808] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:54,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:54,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:11:55,506 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:11:55,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [300424303] [2022-04-28 04:11:55,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [300424303] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:11:55,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:11:55,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-28 04:11:55,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160319014] [2022-04-28 04:11:55,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:11:55,507 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 04:11:55,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:11:55,507 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:11:55,583 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-28 04:11:55,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-28 04:11:55,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:11:55,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-28 04:11:55,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2021, Unknown=0, NotChecked=0, Total=2162 [2022-04-28 04:11:55,585 INFO L87 Difference]: Start difference. First operand 101 states and 103 transitions. Second operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:01,153 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-04-28 04:12:01,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-28 04:12:01,153 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 100 [2022-04-28 04:12:01,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:01,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 128 transitions. [2022-04-28 04:12:01,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 128 transitions. [2022-04-28 04:12:01,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 128 transitions. [2022-04-28 04:12:01,285 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-28 04:12:01,286 INFO L225 Difference]: With dead ends: 120 [2022-04-28 04:12:01,287 INFO L226 Difference]: Without dead ends: 111 [2022-04-28 04:12:01,288 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 38 SyntacticMatches, 18 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1491 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=417, Invalid=7773, Unknown=0, NotChecked=0, Total=8190 [2022-04-28 04:12:01,288 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 114 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 3784 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 3882 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 3784 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:01,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 137 Invalid, 3882 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 3784 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-04-28 04:12:01,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-04-28 04:12:01,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 105. [2022-04-28 04:12:01,345 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:01,345 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,345 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,345 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:01,346 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 04:12:01,346 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 04:12:01,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:01,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:01,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-28 04:12:01,347 INFO L87 Difference]: Start difference. First operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 111 states. [2022-04-28 04:12:01,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:01,348 INFO L93 Difference]: Finished difference Result 111 states and 115 transitions. [2022-04-28 04:12:01,348 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 115 transitions. [2022-04-28 04:12:01,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:01,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:01,349 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:01,349 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:01,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.0297029702970297) internal successors, (104), 101 states have internal predecessors, (104), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2022-04-28 04:12:01,350 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 100 [2022-04-28 04:12:01,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:01,350 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2022-04-28 04:12:01,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.0638297872340425) internal successors, (97), 46 states have internal predecessors, (97), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:01,350 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 105 states and 107 transitions. [2022-04-28 04:12:01,573 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-28 04:12:01,574 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2022-04-28 04:12:01,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-28 04:12:01,574 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:12:01,574 INFO L195 NwaCegarLoop]: trace histogram [36, 36, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:12:01,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-04-28 04:12:01,574 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:12:01,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:12:01,575 INFO L85 PathProgramCache]: Analyzing trace with hash -475437478, now seen corresponding path program 41 times [2022-04-28 04:12:01,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:01,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1983776780] [2022-04-28 04:12:01,784 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:01,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-28 04:12:01,980 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:02,091 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: -1 HavocedVariables, -1 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-28 04:12:02,091 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because SIMULTANEOUS_UPDATE_FAILED [2022-04-28 04:12:06,330 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:12:06,439 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 3 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=2}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:12:06,440 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:12:06,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1696583503, now seen corresponding path program 1 times [2022-04-28 04:12:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:12:06,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181988621] [2022-04-28 04:12:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:12:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:12:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:06,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:12:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:12:06,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20482#true} is VALID [2022-04-28 04:12:06,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {20482#true} assume true; {20482#true} is VALID [2022-04-28 04:12:06,492 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20482#true} {20482#true} #56#return; {20482#true} is VALID [2022-04-28 04:12:06,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {20482#true} call ULTIMATE.init(); {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:12:06,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {20490#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {20482#true} is VALID [2022-04-28 04:12:06,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {20482#true} assume true; {20482#true} is VALID [2022-04-28 04:12:06,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20482#true} {20482#true} #56#return; {20482#true} is VALID [2022-04-28 04:12:06,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {20482#true} call #t~ret7 := main(); {20482#true} is VALID [2022-04-28 04:12:06,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {20482#true} ~a~0 := 6;~b~0 := 6;~c~0 := 6;~a~0 := 0; {20487#(= main_~a~0 0)} is VALID [2022-04-28 04:12:06,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {20487#(= main_~a~0 0)} [144] L21-3-->L21-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_262 v_main_~a~0_261)) (.cse1 (= |v_main_#t~pre4_214| |v_main_#t~pre4_213|)) (.cse2 (= v_main_~c~0_3616 v_main_~c~0_3574)) (.cse3 (= |v_main_#t~pre6_1968| |v_main_#t~pre6_1932|)) (.cse4 (= v_main_~b~0_1380 v_main_~b~0_1373)) (.cse5 (= |v_main_#t~pre5_1053| |v_main_#t~pre5_1047|))) (or (and .cse0 (<= 6 v_main_~a~0_262) .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and (< v_main_~a~0_262 v_main_~a~0_261) (= v_main_~b~0_1373 6) (= 6 v_main_~c~0_3574) (< v_main_~a~0_261 7)))) InVars {main_~c~0=v_main_~c~0_3616, main_~b~0=v_main_~b~0_1380, main_#t~pre4=|v_main_#t~pre4_214|, main_#t~pre5=|v_main_#t~pre5_1053|, main_~a~0=v_main_~a~0_262, main_#t~pre6=|v_main_#t~pre6_1968|} OutVars{main_~c~0=v_main_~c~0_3574, main_~b~0=v_main_~b~0_1373, main_#t~pre4=|v_main_#t~pre4_213|, main_#t~pre5=|v_main_#t~pre5_1047|, main_~a~0=v_main_~a~0_261, main_#t~pre6=|v_main_#t~pre6_1932|} AuxVars[] AssignedVars[main_~c~0, main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0, main_#t~pre6] {20488#(or (= main_~a~0 0) (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0)))} is VALID [2022-04-28 04:12:06,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {20488#(or (= main_~a~0 0) (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0)))} [143] L21-4_primed-->L21-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {20489#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0))} is VALID [2022-04-28 04:12:06,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {20489#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0) (= (+ main_~c~0 (- 6)) 0))} assume !((6 == ~a~0 && 6 == ~b~0) && 6 == ~c~0); {20483#false} is VALID [2022-04-28 04:12:06,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {20483#false} assume !false; {20483#false} is VALID [2022-04-28 04:12:06,495 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:12:06,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:12:06,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181988621] [2022-04-28 04:12:06,495 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181988621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:06,495 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:06,495 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:12:08,953 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:12:08,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1983776780] [2022-04-28 04:12:08,953 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1983776780] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:12:08,953 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:12:08,953 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-28 04:12:08,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420367925] [2022-04-28 04:12:08,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:12:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 04:12:08,954 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:12:08,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:09,035 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-28 04:12:09,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-28 04:12:09,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:12:09,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-28 04:12:09,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=2540, Unknown=0, NotChecked=0, Total=2652 [2022-04-28 04:12:09,036 INFO L87 Difference]: Start difference. First operand 105 states and 107 transitions. Second operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:16,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:16,821 INFO L93 Difference]: Finished difference Result 199 states and 251 transitions. [2022-04-28 04:12:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-28 04:12:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 102 [2022-04-28 04:12:16,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:12:16,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:16,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 162 transitions. [2022-04-28 04:12:16,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:16,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 162 transitions. [2022-04-28 04:12:16,824 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 162 transitions. [2022-04-28 04:12:16,988 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-28 04:12:16,988 INFO L225 Difference]: With dead ends: 199 [2022-04-28 04:12:16,988 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:12:16,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 24 SyntacticMatches, 28 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1551 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=301, Invalid=9011, Unknown=0, NotChecked=0, Total=9312 [2022-04-28 04:12:16,990 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 48 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 4408 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 4408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-28 04:12:16,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 238 Invalid, 4515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 4408 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-28 04:12:16,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:12:16,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:12:16,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:12:16,991 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:12:16,991 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:12:16,991 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:12:16,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:16,991 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:12:16,991 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:12:16,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:16,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:16,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:12:16,992 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 04:12:16,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:12:16,992 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:12:16,992 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:12:16,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:16,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:12:16,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:12:16,992 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:12:16,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 04:12:16,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:12:16,992 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 102 [2022-04-28 04:12:16,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:12:16,992 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:12:16,993 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 1.98) internal successors, (99), 49 states have internal predecessors, (99), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:12:16,993 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:12:16,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:12:16,993 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:12:16,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:12:16,995 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:12:16,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-04-28 04:12:16,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.