/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_2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 04:06:52,573 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 04:06:52,602 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 04:06:52,633 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 04:06:52,633 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 04:06:52,634 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 04:06:52,635 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 04:06:52,637 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 04:06:52,638 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 04:06:52,639 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 04:06:52,640 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 04:06:52,640 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 04:06:52,641 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 04:06:52,642 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 04:06:52,642 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 04:06:52,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 04:06:52,644 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 04:06:52,645 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 04:06:52,646 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 04:06:52,648 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 04:06:52,649 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 04:06:52,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 04:06:52,665 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 04:06:52,666 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 04:06:52,667 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 04:06:52,669 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 04:06:52,670 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 04:06:52,670 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 04:06:52,671 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 04:06:52,671 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 04:06:52,672 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 04:06:52,672 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 04:06:52,673 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 04:06:52,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 04:06:52,674 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 04:06:52,675 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 04:06:52,683 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 04:06:52,684 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 04:06:52,684 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 04:06:52,684 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 04:06:52,685 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 04:06:52,688 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 04:06:52,689 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:06:52,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 04:06:52,701 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 04:06:52,702 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 04:06:52,702 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 04:06:52,703 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 04:06:52,703 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 04:06:52,703 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 04:06:52,703 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 04:06:52,703 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 04:06:52,704 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 04:06:52,704 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 04:06:52,704 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 04:06:52,704 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 04:06:52,705 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 04:06:52,705 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 04:06:52,705 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 04:06:52,705 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 04:06:52,705 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 04:06:52,705 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:06:52,705 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 04:06:52,706 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 04:06:52,706 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 04:06:52,706 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 04:06:52,706 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 04:06:52,706 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 04:06:52,706 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:06:52,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 04:06:52,944 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 04:06:52,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 04:06:52,947 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 04:06:52,948 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 04:06:52,950 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-28 04:06:53,011 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfb07553/8680b20507a643778440d7cf58cab6f6/FLAGc5dd906f3 [2022-04-28 04:06:53,369 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 04:06:53,369 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c [2022-04-28 04:06:53,376 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfb07553/8680b20507a643778440d7cf58cab6f6/FLAGc5dd906f3 [2022-04-28 04:06:53,797 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ebfb07553/8680b20507a643778440d7cf58cab6f6 [2022-04-28 04:06:53,799 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 04:06:53,800 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 04:06:53,802 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 04:06:53,802 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 04:06:53,804 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 04:06:53,805 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:06:53" (1/1) ... [2022-04-28 04:06:53,807 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d248dd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:53, skipping insertion in model container [2022-04-28 04:06:53,807 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 04:06:53" (1/1) ... [2022-04-28 04:06:53,814 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 04:06:53,824 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 04:06:54,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2022-04-28 04:06:54,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:06:54,070 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 04:06:54,082 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_2.c[730,743] [2022-04-28 04:06:54,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 04:06:54,097 INFO L208 MainTranslator]: Completed translation [2022-04-28 04:06:54,098 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54 WrapperNode [2022-04-28 04:06:54,098 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 04:06:54,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 04:06:54,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 04:06:54,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 04:06:54,109 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,109 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,115 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,116 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,124 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,129 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,133 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,135 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 04:06:54,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 04:06:54,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 04:06:54,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 04:06:54,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (1/1) ... [2022-04-28 04:06:54,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 04:06:54,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 04:06:54,173 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:06:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 04:06:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 04:06:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 04:06:54,208 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 04:06:54,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 04:06:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 04:06:54,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 04:06:54,192 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:06:54,254 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 04:06:54,255 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 04:06:54,342 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 04:06:54,353 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 04:06:54,353 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 04:06:54,355 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:06:54 BoogieIcfgContainer [2022-04-28 04:06:54,355 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 04:06:54,370 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 04:06:54,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 04:06:54,373 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 04:06:54,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 04:06:53" (1/3) ... [2022-04-28 04:06:54,374 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdcf671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:06:54, skipping insertion in model container [2022-04-28 04:06:54,374 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 04:06:54" (2/3) ... [2022-04-28 04:06:54,375 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fdcf671 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 04:06:54, skipping insertion in model container [2022-04-28 04:06:54,375 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 04:06:54" (3/3) ... [2022-04-28 04:06:54,376 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_2.c [2022-04-28 04:06:54,403 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 04:06:54,403 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 04:06:54,456 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 04:06:54,463 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@5bb2f1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3c19a448 [2022-04-28 04:06:54,463 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 04:06:54,470 INFO L276 IsEmpty]: Start isEmpty. Operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 04:06:54,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-28 04:06:54,479 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:54,479 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:54,479 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:54,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:54,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 1 times [2022-04-28 04:06:54,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:54,494 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6028419] [2022-04-28 04:06:54,501 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 04:06:54,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1747983725, now seen corresponding path program 2 times [2022-04-28 04:06:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754553012] [2022-04-28 04:06:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:54,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:54,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:54,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 04:06:54,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 04:06:54,712 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-28 04:06:54,718 INFO L272 TraceCheckUtils]: 0: Hoare triple {21#true} call ULTIMATE.init(); {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:54,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {21#true} is VALID [2022-04-28 04:06:54,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {21#true} assume true; {21#true} is VALID [2022-04-28 04:06:54,719 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21#true} {21#true} #44#return; {21#true} is VALID [2022-04-28 04:06:54,719 INFO L272 TraceCheckUtils]: 4: Hoare triple {21#true} call #t~ret6 := main(); {21#true} is VALID [2022-04-28 04:06:54,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {21#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {26#(= main_~a~0 0)} is VALID [2022-04-28 04:06:54,722 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#(= main_~a~0 0)} assume !(~a~0 < 6); {22#false} is VALID [2022-04-28 04:06:54,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {22#false} assume !(6 == ~a~0 && 6 == ~b~0); {22#false} is VALID [2022-04-28 04:06:54,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {22#false} assume !false; {22#false} is VALID [2022-04-28 04:06:54,723 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:06:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:54,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754553012] [2022-04-28 04:06:54,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754553012] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:54,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:54,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:54,731 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:54,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6028419] [2022-04-28 04:06:54,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6028419] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:54,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:54,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:54,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [835701484] [2022-04-28 04:06:54,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:54,738 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:06:54,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:54,743 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:06:54,763 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:06:54,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 04:06:54,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:54,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 04:06:54,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 04:06:54,788 INFO L87 Difference]: Start difference. First operand has 18 states, 12 states have (on average 1.5) internal successors, (18), 13 states have internal predecessors, (18), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:54,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:54,938 INFO L93 Difference]: Finished difference Result 34 states and 46 transitions. [2022-04-28 04:06:54,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 04:06:54,938 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:06:54,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:54,940 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:06:54,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-28 04:06:54,954 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:06:54,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 46 transitions. [2022-04-28 04:06:54,958 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 46 transitions. [2022-04-28 04:06:55,019 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:06:55,027 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:06:55,027 INFO L226 Difference]: Without dead ends: 17 [2022-04-28 04:06:55,031 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:06:55,035 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 20 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:55,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:55,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-28 04:06:55,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 14. [2022-04-28 04:06:55,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:55,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,071 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,072 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,081 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 04:06:55,081 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 04:06:55,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,082 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 04:06:55,083 INFO L87 Difference]: Start difference. First operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 17 states. [2022-04-28 04:06:55,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,086 INFO L93 Difference]: Finished difference Result 17 states and 19 transitions. [2022-04-28 04:06:55,086 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 19 transitions. [2022-04-28 04:06:55,087 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,087 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,087 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:55,087 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:55,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 15 transitions. [2022-04-28 04:06:55,091 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 15 transitions. Word has length 9 [2022-04-28 04:06:55,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:55,092 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 15 transitions. [2022-04-28 04:06:55,092 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:06:55,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 15 transitions. [2022-04-28 04:06:55,114 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:06:55,114 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 15 transitions. [2022-04-28 04:06:55,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-28 04:06:55,115 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:55,115 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:55,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 04:06:55,117 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:55,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:55,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1955520686, now seen corresponding path program 1 times [2022-04-28 04:06:55,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1557374034] [2022-04-28 04:06:55,243 INFO L89 AcceleratorJordan]: Jordan 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:06:55,244 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:55,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1648133595, now seen corresponding path program 1 times [2022-04-28 04:06:55,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:55,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724538287] [2022-04-28 04:06:55,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:55,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:55,347 INFO L290 TraceCheckUtils]: 0: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-28 04:06:55,348 INFO L290 TraceCheckUtils]: 1: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 04:06:55,348 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-28 04:06:55,348 INFO L272 TraceCheckUtils]: 0: Hoare triple {162#true} call ULTIMATE.init(); {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:55,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {168#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {162#true} is VALID [2022-04-28 04:06:55,349 INFO L290 TraceCheckUtils]: 2: Hoare triple {162#true} assume true; {162#true} is VALID [2022-04-28 04:06:55,349 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {162#true} {162#true} #44#return; {162#true} is VALID [2022-04-28 04:06:55,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {162#true} call #t~ret6 := main(); {162#true} is VALID [2022-04-28 04:06:55,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {162#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {167#(= main_~a~0 0)} is VALID [2022-04-28 04:06:55,352 INFO L290 TraceCheckUtils]: 6: Hoare triple {167#(= main_~a~0 0)} [48] L20-3-->L20-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] {167#(= main_~a~0 0)} is VALID [2022-04-28 04:06:55,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(= main_~a~0 0)} [47] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {163#false} is VALID [2022-04-28 04:06:55,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {163#false} assume !(6 == ~a~0 && 6 == ~b~0); {163#false} is VALID [2022-04-28 04:06:55,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {163#false} assume !false; {163#false} is VALID [2022-04-28 04:06:55,354 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:06:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:55,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724538287] [2022-04-28 04:06:55,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724538287] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:55,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:55,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:55,378 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1557374034] [2022-04-28 04:06:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1557374034] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:55,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:55,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 04:06:55,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233611282] [2022-04-28 04:06:55,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:55,381 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:06:55,381 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:55,381 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:06:55,394 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:06:55,394 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 04:06:55,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:55,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 04:06:55,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-28 04:06:55,396 INFO L87 Difference]: Start difference. First operand 14 states and 15 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,484 INFO L93 Difference]: Finished difference Result 26 states and 30 transitions. [2022-04-28 04:06:55,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 04:06:55,484 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:06:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:06:55,485 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:06:55,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 04:06:55,486 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:06:55,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 30 transitions. [2022-04-28 04:06:55,487 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 30 transitions. [2022-04-28 04:06:55,514 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:06:55,515 INFO L225 Difference]: With dead ends: 26 [2022-04-28 04:06:55,515 INFO L226 Difference]: Without dead ends: 19 [2022-04-28 04:06:55,516 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:06:55,517 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 19 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:06:55,517 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 22 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:06:55,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-28 04:06:55,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 15. [2022-04-28 04:06:55,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:06:55,523 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,524 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,524 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,527 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 04:06:55,527 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 04:06:55,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:06:55,530 INFO L87 Difference]: Start difference. First operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 19 states. [2022-04-28 04:06:55,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:06:55,531 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-28 04:06:55,532 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-28 04:06:55,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:06:55,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:06:55,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:06:55,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:06:55,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.1818181818181819) internal successors, (13), 11 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:55,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-28 04:06:55,535 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-28 04:06:55,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:06:55,535 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-28 04:06:55,535 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:06:55,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-28 04:06:55,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:55,555 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-28 04:06:55,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-28 04:06:55,555 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:06:55,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:06:55,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 04:06:55,558 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:06:55,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:06:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash -686991696, now seen corresponding path program 1 times [2022-04-28 04:06:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:55,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1171160945] [2022-04-28 04:06:59,689 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:06:59,795 INFO 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:06:59,900 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:06:59,901 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:06:59,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1648195099, now seen corresponding path program 1 times [2022-04-28 04:06:59,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:06:59,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239017140] [2022-04-28 04:06:59,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:06:59,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:06:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:59,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:06:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:06:59,942 INFO L290 TraceCheckUtils]: 0: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 04:06:59,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 04:06:59,943 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {296#true} {296#true} #44#return; {296#true} is VALID [2022-04-28 04:06:59,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {296#true} call ULTIMATE.init(); {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:06:59,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {302#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {296#true} is VALID [2022-04-28 04:06:59,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {296#true} assume true; {296#true} is VALID [2022-04-28 04:06:59,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {296#true} {296#true} #44#return; {296#true} is VALID [2022-04-28 04:06:59,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {296#true} call #t~ret6 := main(); {296#true} is VALID [2022-04-28 04:06:59,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {296#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {301#(= main_~a~0 0)} is VALID [2022-04-28 04:06:59,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {301#(= main_~a~0 0)} [50] L20-3-->L20-4_primed: Formula: (and (= |v_main_#t~pre5_10| |v_main_#t~pre5_9|) (= |v_main_#t~pre4_9| |v_main_#t~pre4_8|) (= v_main_~a~0_16 v_main_~a~0_15) (= v_main_~b~0_23 v_main_~b~0_21)) InVars {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_~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_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {301#(= main_~a~0 0)} is VALID [2022-04-28 04:06:59,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {301#(= main_~a~0 0)} [49] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {297#false} is VALID [2022-04-28 04:06:59,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {297#false} assume !(6 == ~a~0 && 6 == ~b~0); {297#false} is VALID [2022-04-28 04:06:59,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {297#false} assume !false; {297#false} is VALID [2022-04-28 04:06:59,947 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:06:59,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:06:59,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239017140] [2022-04-28 04:06:59,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239017140] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:59,947 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:59,947 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:06:59,979 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:06:59,979 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1171160945] [2022-04-28 04:06:59,979 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1171160945] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:06:59,979 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:06:59,979 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:06:59,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567165005] [2022-04-28 04:06:59,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:06:59,980 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:06:59,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:06:59,980 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:06:59,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:06:59,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 04:06:59,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:06:59,993 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 04:06:59,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 04:06:59,993 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,104 INFO L93 Difference]: Finished difference Result 28 states and 32 transitions. [2022-04-28 04:07:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 04:07:00,105 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-28 04:07:00,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:00,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 04:07:00,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2022-04-28 04:07:00,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 32 transitions. [2022-04-28 04:07:00,134 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:00,135 INFO L225 Difference]: With dead ends: 28 [2022-04-28 04:07:00,135 INFO L226 Difference]: Without dead ends: 21 [2022-04-28 04:07:00,136 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:07:00,137 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 22 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:00,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 22 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 04:07:00,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-28 04:07:00,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 17. [2022-04-28 04:07:00,141 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:00,141 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,141 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,142 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,143 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 04:07:00,143 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 04:07:00,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:00,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:00,144 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:07:00,144 INFO L87 Difference]: Start difference. First operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-28 04:07:00,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:00,145 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-04-28 04:07:00,145 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-04-28 04:07:00,146 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:00,146 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:00,146 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:00,146 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:00,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-28 04:07:00,147 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-28 04:07:00,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:00,147 INFO L495 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-28 04:07:00,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:00,147 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-28 04:07:00,177 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:00,177 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-28 04:07:00,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 04:07:00,178 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:00,178 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:00,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-28 04:07:00,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:00,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:00,181 INFO L85 PathProgramCache]: Analyzing trace with hash -1401344370, now seen corresponding path program 2 times [2022-04-28 04:07:00,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:00,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [801000527] [2022-04-28 04:07:02,307 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:02,386 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:02,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:02,484 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:02,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1648256603, now seen corresponding path program 1 times [2022-04-28 04:07:02,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:02,485 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118337432] [2022-04-28 04:07:02,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:02,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:02,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:02,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:02,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:02,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {445#true} is VALID [2022-04-28 04:07:02,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-28 04:07:02,524 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {445#true} {445#true} #44#return; {445#true} is VALID [2022-04-28 04:07:02,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {445#true} call ULTIMATE.init(); {451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:02,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {451#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {445#true} is VALID [2022-04-28 04:07:02,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {445#true} assume true; {445#true} is VALID [2022-04-28 04:07:02,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {445#true} {445#true} #44#return; {445#true} is VALID [2022-04-28 04:07:02,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {445#true} call #t~ret6 := main(); {445#true} is VALID [2022-04-28 04:07:02,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {445#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {450#(= main_~a~0 0)} is VALID [2022-04-28 04:07:02,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {450#(= main_~a~0 0)} [52] L20-3-->L20-4_primed: Formula: (let ((.cse0 (= v_main_~a~0_22 v_main_~a~0_21)) (.cse1 (= |v_main_#t~pre4_14| |v_main_#t~pre4_13|)) (.cse2 (= |v_main_#t~pre5_23| |v_main_#t~pre5_21|))) (or (and .cse0 (= v_main_~b~0_40 v_main_~b~0_37) .cse1 .cse2) (and .cse0 .cse1 .cse2 (= v_main_~b~0_37 v_main_~b~0_40)))) InVars {main_~b~0=v_main_~b~0_40, main_#t~pre4=|v_main_#t~pre4_14|, main_#t~pre5=|v_main_#t~pre5_23|, main_~a~0=v_main_~a~0_22} OutVars{main_~b~0=v_main_~b~0_37, main_#t~pre4=|v_main_#t~pre4_13|, main_#t~pre5=|v_main_#t~pre5_21|, main_~a~0=v_main_~a~0_21} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {450#(= main_~a~0 0)} is VALID [2022-04-28 04:07:02,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {450#(= main_~a~0 0)} [51] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {446#false} is VALID [2022-04-28 04:07:02,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {446#false} assume !(6 == ~a~0 && 6 == ~b~0); {446#false} is VALID [2022-04-28 04:07:02,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {446#false} assume !false; {446#false} is VALID [2022-04-28 04:07:02,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-28 04:07:02,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:02,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118337432] [2022-04-28 04:07:02,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118337432] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:02,528 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:02,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:02,584 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:02,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [801000527] [2022-04-28 04:07:02,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [801000527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:02,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:02,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 04:07:02,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953501860] [2022-04-28 04:07:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:02,585 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:07:02,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:02,585 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call 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:02,600 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 04:07:02,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 04:07:02,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:02,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 04:07:02,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-28 04:07:02,601 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call 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:02,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:02,783 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-28 04:07:02,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 04:07:02,783 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2022-04-28 04:07:02,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:02,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call 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:02,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 04:07:02,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call 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:02,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 34 transitions. [2022-04-28 04:07:02,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 34 transitions. [2022-04-28 04:07:02,825 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:02,829 INFO L225 Difference]: With dead ends: 30 [2022-04-28 04:07:02,829 INFO L226 Difference]: Without dead ends: 23 [2022-04-28 04:07:02,830 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-04-28 04:07:02,832 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:02,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:02,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-04-28 04:07:02,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 19. [2022-04-28 04:07:02,843 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:02,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:02,845 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:02,845 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:02,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:02,850 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 04:07:02,850 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 04:07:02,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:02,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:02,851 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 23 states. [2022-04-28 04:07:02,851 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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 23 states. [2022-04-28 04:07:02,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:02,852 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2022-04-28 04:07:02,852 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-04-28 04:07:02,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:02,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:02,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:02,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:02,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 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:02,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-28 04:07:02,854 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 16 [2022-04-28 04:07:02,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:02,854 INFO L495 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-28 04:07:02,854 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call 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:02,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-28 04:07:02,877 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:02,877 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-28 04:07:02,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-28 04:07:02,877 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:02,877 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:02,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-28 04:07:02,879 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:02,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:02,879 INFO L85 PathProgramCache]: Analyzing trace with hash -699496724, now seen corresponding path program 3 times [2022-04-28 04:07:02,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:02,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1765567943] [2022-04-28 04:07:03,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:07:03,143 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:07:03,143 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:03,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1648318107, now seen corresponding path program 1 times [2022-04-28 04:07:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:03,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571877290] [2022-04-28 04:07:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:03,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:03,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:03,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:03,183 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 04:07:03,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 04:07:03,183 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {609#true} {609#true} #44#return; {609#true} is VALID [2022-04-28 04:07:03,184 INFO L272 TraceCheckUtils]: 0: Hoare triple {609#true} call ULTIMATE.init(); {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:03,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-04-28 04:07:03,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume true; {609#true} is VALID [2022-04-28 04:07:03,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {609#true} {609#true} #44#return; {609#true} is VALID [2022-04-28 04:07:03,184 INFO L272 TraceCheckUtils]: 4: Hoare triple {609#true} call #t~ret6 := main(); {609#true} is VALID [2022-04-28 04:07:03,185 INFO L290 TraceCheckUtils]: 5: Hoare triple {609#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {614#(= main_~a~0 0)} is VALID [2022-04-28 04:07:03,185 INFO L290 TraceCheckUtils]: 6: Hoare triple {614#(= main_~a~0 0)} [54] L20-3-->L20-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_19| |v_main_#t~pre4_18|)) (.cse1 (= v_main_~a~0_28 v_main_~a~0_27)) (.cse2 (= |v_main_#t~pre5_37| |v_main_#t~pre5_34|))) (or (and .cse0 .cse1 .cse2 (= v_main_~b~0_55 v_main_~b~0_59)) (and .cse0 .cse1 .cse2 (= v_main_~b~0_59 v_main_~b~0_55)))) InVars {main_~b~0=v_main_~b~0_59, main_#t~pre4=|v_main_#t~pre4_19|, main_#t~pre5=|v_main_#t~pre5_37|, main_~a~0=v_main_~a~0_28} OutVars{main_~b~0=v_main_~b~0_55, main_#t~pre4=|v_main_#t~pre4_18|, main_#t~pre5=|v_main_#t~pre5_34|, main_~a~0=v_main_~a~0_27} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {614#(= main_~a~0 0)} is VALID [2022-04-28 04:07:03,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {614#(= main_~a~0 0)} [53] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {610#false} is VALID [2022-04-28 04:07:03,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {610#false} assume !(6 == ~a~0 && 6 == ~b~0); {610#false} is VALID [2022-04-28 04:07:03,186 INFO L290 TraceCheckUtils]: 9: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-04-28 04:07:03,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:07:03,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:03,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571877290] [2022-04-28 04:07:03,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571877290] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:03,187 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:03,187 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:03,239 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:03,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1765567943] [2022-04-28 04:07:03,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1765567943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:03,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:03,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 04:07:03,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776291914] [2022-04-28 04:07:03,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:03,241 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 04:07:03,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:03,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:03,257 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:03,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 04:07:03,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:03,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 04:07:03,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 04:07:03,258 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:03,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:03,430 INFO L93 Difference]: Finished difference Result 32 states and 36 transitions. [2022-04-28 04:07:03,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 04:07:03,431 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-04-28 04:07:03,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:03,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:03,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 04:07:03,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call 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:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 36 transitions. [2022-04-28 04:07:03,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 36 transitions. [2022-04-28 04:07:03,465 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:07:03,466 INFO L225 Difference]: With dead ends: 32 [2022-04-28 04:07:03,466 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 04:07:03,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-04-28 04:07:03,467 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:03,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 17 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:03,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 04:07:03,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2022-04-28 04:07:03,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:03,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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:03,473 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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:03,473 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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:03,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:03,474 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 04:07:03,474 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 04:07:03,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:03,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:03,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 25 states. [2022-04-28 04:07:03,475 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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 25 states. [2022-04-28 04:07:03,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:03,476 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 04:07:03,476 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 04:07:03,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:03,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:03,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:03,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:03,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 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:03,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-04-28 04:07:03,478 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2022-04-28 04:07:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:03,478 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-04-28 04:07:03,478 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 7 states have internal predecessors, (15), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:03,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 22 transitions. [2022-04-28 04:07:03,499 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:03,499 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-28 04:07:03,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-28 04:07:03,499 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:03,499 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:03,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-04-28 04:07:03,500 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:03,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:03,500 INFO L85 PathProgramCache]: Analyzing trace with hash -533774390, now seen corresponding path program 4 times [2022-04-28 04:07:03,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:03,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1721864714] [2022-04-28 04:07:03,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:03,735 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:07:03,736 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:03,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1648379611, now seen corresponding path program 1 times [2022-04-28 04:07:03,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:03,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784829096] [2022-04-28 04:07:03,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:03,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:03,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:03,798 INFO L290 TraceCheckUtils]: 0: Hoare triple {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 04:07:03,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 04:07:03,799 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 04:07:03,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {788#true} call ULTIMATE.init(); {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:03,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {794#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {788#true} is VALID [2022-04-28 04:07:03,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {788#true} assume true; {788#true} is VALID [2022-04-28 04:07:03,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {788#true} {788#true} #44#return; {788#true} is VALID [2022-04-28 04:07:03,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {788#true} call #t~ret6 := main(); {788#true} is VALID [2022-04-28 04:07:03,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {788#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {793#(= main_~a~0 0)} is VALID [2022-04-28 04:07:03,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {793#(= main_~a~0 0)} [56] L20-3-->L20-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_24| |v_main_#t~pre4_23|)) (.cse1 (= v_main_~a~0_34 v_main_~a~0_33))) (or (and .cse0 (= |v_main_#t~pre5_52| |v_main_#t~pre5_48|) (= v_main_~b~0_80 v_main_~b~0_75) .cse1) (and (= |v_main_#t~pre5_48| |v_main_#t~pre5_52|) .cse0 (= v_main_~b~0_75 v_main_~b~0_80) .cse1))) InVars {main_~b~0=v_main_~b~0_80, main_#t~pre4=|v_main_#t~pre4_24|, main_#t~pre5=|v_main_#t~pre5_52|, main_~a~0=v_main_~a~0_34} OutVars{main_~b~0=v_main_~b~0_75, main_#t~pre4=|v_main_#t~pre4_23|, main_#t~pre5=|v_main_#t~pre5_48|, main_~a~0=v_main_~a~0_33} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {793#(= main_~a~0 0)} is VALID [2022-04-28 04:07:03,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {793#(= main_~a~0 0)} [55] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {789#false} is VALID [2022-04-28 04:07:03,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {789#false} assume !(6 == ~a~0 && 6 == ~b~0); {789#false} is VALID [2022-04-28 04:07:03,805 INFO L290 TraceCheckUtils]: 9: Hoare triple {789#false} assume !false; {789#false} is VALID [2022-04-28 04:07:03,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:07:03,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:03,805 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784829096] [2022-04-28 04:07:03,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784829096] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:03,805 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:03,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:03,896 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:03,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1721864714] [2022-04-28 04:07:03,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1721864714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:03,897 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:03,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 04:07:03,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071040101] [2022-04-28 04:07:03,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:03,897 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 04:07:03,897 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:03,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:03,914 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:03,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 04:07:03,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:03,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 04:07:03,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-28 04:07:03,915 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:04,176 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 04:07:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-28 04:07:04,177 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-28 04:07:04,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:04,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:04,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 04:07:04,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:04,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 38 transitions. [2022-04-28 04:07:04,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 38 transitions. [2022-04-28 04:07:04,213 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:07:04,214 INFO L225 Difference]: With dead ends: 34 [2022-04-28 04:07:04,214 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 04:07:04,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 11 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:04,215 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:04,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 27 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:04,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 04:07:04,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-04-28 04:07:04,220 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:04,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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:04,220 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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:04,220 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:04,221 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 04:07:04,222 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 04:07:04,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:04,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:04,222 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 27 states. [2022-04-28 04:07:04,222 INFO L87 Difference]: Start difference. First operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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 27 states. [2022-04-28 04:07:04,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:04,223 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-28 04:07:04,223 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-04-28 04:07:04,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:04,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:04,224 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:04,224 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:04,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 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:04,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-28 04:07:04,225 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2022-04-28 04:07:04,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:04,225 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-28 04:07:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:04,225 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-28 04:07:04,250 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:04,250 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-28 04:07:04,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 04:07:04,251 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:04,251 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:04,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-04-28 04:07:04,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:04,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:04,251 INFO L85 PathProgramCache]: Analyzing trace with hash -188401368, now seen corresponding path program 5 times [2022-04-28 04:07:04,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:04,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1703227078] [2022-04-28 04:07:08,357 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:08,418 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-28 04:07:08,501 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:07:08,501 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:08,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1648441115, now seen corresponding path program 1 times [2022-04-28 04:07:08,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:08,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277591293] [2022-04-28 04:07:08,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:08,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:08,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:08,532 INFO L290 TraceCheckUtils]: 0: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {982#true} is VALID [2022-04-28 04:07:08,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {982#true} assume true; {982#true} is VALID [2022-04-28 04:07:08,533 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {982#true} {982#true} #44#return; {982#true} is VALID [2022-04-28 04:07:08,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {982#true} call ULTIMATE.init(); {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:08,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {988#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {982#true} is VALID [2022-04-28 04:07:08,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {982#true} assume true; {982#true} is VALID [2022-04-28 04:07:08,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {982#true} {982#true} #44#return; {982#true} is VALID [2022-04-28 04:07:08,534 INFO L272 TraceCheckUtils]: 4: Hoare triple {982#true} call #t~ret6 := main(); {982#true} is VALID [2022-04-28 04:07:08,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {982#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {987#(= main_~a~0 0)} is VALID [2022-04-28 04:07:08,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {987#(= main_~a~0 0)} [58] L20-3-->L20-4_primed: Formula: (and (= v_main_~a~0_40 v_main_~a~0_39) (= |v_main_#t~pre5_68| |v_main_#t~pre5_63|) (= v_main_~b~0_103 v_main_~b~0_97) (= |v_main_#t~pre4_29| |v_main_#t~pre4_28|)) InVars {main_~b~0=v_main_~b~0_103, main_#t~pre4=|v_main_#t~pre4_29|, main_#t~pre5=|v_main_#t~pre5_68|, main_~a~0=v_main_~a~0_40} OutVars{main_~b~0=v_main_~b~0_97, main_#t~pre4=|v_main_#t~pre4_28|, main_#t~pre5=|v_main_#t~pre5_63|, main_~a~0=v_main_~a~0_39} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {987#(= main_~a~0 0)} is VALID [2022-04-28 04:07:08,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {987#(= main_~a~0 0)} [57] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {983#false} is VALID [2022-04-28 04:07:08,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {983#false} assume !(6 == ~a~0 && 6 == ~b~0); {983#false} is VALID [2022-04-28 04:07:08,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {983#false} assume !false; {983#false} is VALID [2022-04-28 04:07:08,536 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:08,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:08,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277591293] [2022-04-28 04:07:08,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277591293] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:08,536 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:08,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 04:07:08,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:08,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1703227078] [2022-04-28 04:07:08,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1703227078] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:08,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:08,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 04:07:08,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54921746] [2022-04-28 04:07:08,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:08,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 04:07:08,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:08,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:08,666 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:08,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 04:07:08,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:08,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 04:07:08,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 04:07:08,667 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:08,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:08,939 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2022-04-28 04:07:08,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 04:07:08,939 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-04-28 04:07:08,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:08,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:08,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 04:07:08,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:08,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-04-28 04:07:08,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-04-28 04:07:08,978 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:07:08,979 INFO L225 Difference]: With dead ends: 36 [2022-04-28 04:07:08,979 INFO L226 Difference]: Without dead ends: 29 [2022-04-28 04:07:08,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 11 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2022-04-28 04:07:08,980 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 29 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:08,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 37 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 04:07:08,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-28 04:07:08,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 25. [2022-04-28 04:07:08,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:08,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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:08,985 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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:08,985 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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:08,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:08,986 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 04:07:08,986 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 04:07:08,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:08,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:08,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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 29 states. [2022-04-28 04:07:08,987 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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 29 states. [2022-04-28 04:07:08,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:08,988 INFO L93 Difference]: Finished difference Result 29 states and 31 transitions. [2022-04-28 04:07:08,988 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 04:07:08,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:08,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:08,989 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:08,989 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:08,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.0952380952380953) internal successors, (23), 21 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:08,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-04-28 04:07:08,990 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2022-04-28 04:07:08,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:08,990 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-04-28 04:07:08,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:08,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 26 transitions. [2022-04-28 04:07:09,020 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:09,020 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-28 04:07:09,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-28 04:07:09,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 04:07:09,021 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:09,021 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-04-28 04:07:09,021 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 04:07:09,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 04:07:09,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1002590982, now seen corresponding path program 6 times [2022-04-28 04:07:09,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:09,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1003336796] [2022-04-28 04:07:13,125 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-28 04:07:13,199 INFO 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:13,418 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:07:13,420 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-28 04:07:13,422 INFO L85 PathProgramCache]: Analyzing trace with hash 1648502619, now seen corresponding path program 1 times [2022-04-28 04:07:13,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 04:07:13,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474960151] [2022-04-28 04:07:13,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 04:07:13,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 04:07:13,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:13,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 04:07:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 04:07:13,485 INFO L290 TraceCheckUtils]: 0: Hoare triple {1199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 04:07:13,485 INFO L290 TraceCheckUtils]: 1: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 04:07:13,485 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1191#true} {1191#true} #44#return; {1191#true} is VALID [2022-04-28 04:07:13,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {1191#true} call ULTIMATE.init(); {1199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 04:07:13,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {1199#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {1191#true} is VALID [2022-04-28 04:07:13,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {1191#true} assume true; {1191#true} is VALID [2022-04-28 04:07:13,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1191#true} {1191#true} #44#return; {1191#true} is VALID [2022-04-28 04:07:13,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {1191#true} call #t~ret6 := main(); {1191#true} is VALID [2022-04-28 04:07:13,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {1191#true} ~a~0 := 6;~b~0 := 6;~a~0 := 0; {1196#(= main_~a~0 0)} is VALID [2022-04-28 04:07:13,488 INFO L290 TraceCheckUtils]: 6: Hoare triple {1196#(= main_~a~0 0)} [60] L20-3-->L20-4_primed: Formula: (let ((.cse0 (= v_main_~b~0_128 v_main_~b~0_121)) (.cse1 (= |v_main_#t~pre5_85| |v_main_#t~pre5_79|)) (.cse2 (= |v_main_#t~pre4_34| |v_main_#t~pre4_33|)) (.cse3 (= v_main_~a~0_46 v_main_~a~0_45))) (or (and (= v_main_~b~0_121 6) (< v_main_~a~0_45 7) (< v_main_~a~0_46 v_main_~a~0_45)) (and (<= 6 v_main_~a~0_46) .cse0 .cse1 .cse2 .cse3) (and .cse0 .cse1 .cse2 .cse3))) InVars {main_~b~0=v_main_~b~0_128, main_#t~pre4=|v_main_#t~pre4_34|, main_#t~pre5=|v_main_#t~pre5_85|, main_~a~0=v_main_~a~0_46} OutVars{main_~b~0=v_main_~b~0_121, main_#t~pre4=|v_main_#t~pre4_33|, main_#t~pre5=|v_main_#t~pre5_79|, main_~a~0=v_main_~a~0_45} AuxVars[] AssignedVars[main_~b~0, main_#t~pre4, main_#t~pre5, main_~a~0] {1197#(or (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0)) (<= main_~a~0 0))} is VALID [2022-04-28 04:07:13,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {1197#(or (and (<= main_~a~0 6) (= (+ main_~b~0 (- 6)) 0)) (<= main_~a~0 0))} [59] L20-4_primed-->L20-4: Formula: (not (< v_main_~a~0_5 6)) InVars {main_~a~0=v_main_~a~0_5} OutVars{main_~a~0=v_main_~a~0_5} AuxVars[] AssignedVars[] {1198#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0))} is VALID [2022-04-28 04:07:13,492 INFO L290 TraceCheckUtils]: 8: Hoare triple {1198#(and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0))} assume !(6 == ~a~0 && 6 == ~b~0); {1192#false} is VALID [2022-04-28 04:07:13,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {1192#false} assume !false; {1192#false} is VALID [2022-04-28 04:07:13,492 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:13,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 04:07:13,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474960151] [2022-04-28 04:07:13,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474960151] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:13,493 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:13,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 04:07:13,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 04:07:13,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1003336796] [2022-04-28 04:07:13,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1003336796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 04:07:13,793 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 04:07:13,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 04:07:13,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814193648] [2022-04-28 04:07:13,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 04:07:13,794 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 04:07:13,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 04:07:13,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:13,815 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:13,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 04:07:13,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 04:07:13,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 04:07:13,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-28 04:07:13,816 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:14,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:14,336 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-28 04:07:14,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 04:07:14,336 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-04-28 04:07:14,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 04:07:14,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:14,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-28 04:07:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:14,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 39 transitions. [2022-04-28 04:07:14,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 39 transitions. [2022-04-28 04:07:14,372 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:14,372 INFO L225 Difference]: With dead ends: 41 [2022-04-28 04:07:14,372 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 04:07:14,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 5 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=471, Unknown=0, NotChecked=0, Total=552 [2022-04-28 04:07:14,374 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 12 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 04:07:14,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 48 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 04:07:14,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 04:07:14,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 04:07:14,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 04:07:14,374 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:07:14,375 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:07:14,375 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:07:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:14,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:07:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:07:14,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:14,375 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:14,375 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:07:14,375 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:07:14,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 04:07:14,375 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 04:07:14,375 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:07:14,375 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:14,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 04:07:14,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 04:07:14,376 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 04:07:14,376 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:07:14,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 04:07:14,376 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-04-28 04:07:14,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 04:07:14,376 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 04:07:14,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.6153846153846154) internal successors, (21), 12 states have internal predecessors, (21), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 04:07:14,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 04:07:14,376 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:07:14,376 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 04:07:14,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 04:07:14,379 INFO L805 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 04:07:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-04-28 04:07:14,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 04:07:16,967 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-28 04:07:16,967 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-28 04:07:16,967 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 15 29) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L902 garLoopResultBuilder]: At program point L25-1(lines 25 27) the Hoare annotation is: true [2022-04-28 04:07:16,967 INFO L895 garLoopResultBuilder]: At program point L21-2(lines 21 23) the Hoare annotation is: (let ((.cse0 (or (= main_~a~0 0) (< 0 main_~a~0))) (.cse1 (< main_~a~0 6))) (or (and (= main_~b~0 1) .cse0 .cse1) (and (= main_~b~0 0) .cse0 .cse1) (and (= 5 main_~b~0) .cse0 .cse1) (and (= main_~b~0 2) .cse0 .cse1) (and (= main_~b~0 3) .cse0 .cse1) (and (= main_~b~0 4) .cse0 .cse1))) [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point L21-3(lines 21 23) the Hoare annotation is: (let ((.cse0 (or (= main_~a~0 0) (< 0 main_~a~0))) (.cse1 (< main_~a~0 6))) (or (and (= main_~b~0 1) .cse0 .cse1) (and (= main_~b~0 0) .cse0 .cse1) (and (= 5 main_~b~0) .cse0 .cse1) (and (= main_~b~0 6) .cse0 .cse1) (and (= main_~b~0 2) .cse0 .cse1) (and (= main_~b~0 3) .cse0 .cse1) (and (= main_~b~0 4) .cse0 .cse1))) [2022-04-28 04:07:16,968 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 15 29) the Hoare annotation is: true [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 26) the Hoare annotation is: false [2022-04-28 04:07:16,968 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 15 29) the Hoare annotation is: true [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point L26(line 26) the Hoare annotation is: false [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point L20-2(lines 20 24) the Hoare annotation is: (and (= 5 (+ (- 1) main_~b~0)) (or (= main_~a~0 0) (< 0 main_~a~0)) (< main_~a~0 6)) [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point L20-3(lines 20 24) the Hoare annotation is: (let ((.cse0 (= main_~b~0 6))) (or (and .cse0 (< main_~a~0 7) (or (= main_~a~0 1) (< 1 main_~a~0))) (and (= main_~a~0 0) .cse0))) [2022-04-28 04:07:16,968 INFO L895 garLoopResultBuilder]: At program point L20-4(lines 15 29) the Hoare annotation is: (and (= (+ main_~a~0 (- 6)) 0) (= (+ main_~b~0 (- 6)) 0)) [2022-04-28 04:07:16,971 INFO L356 BasicCegarLoop]: Path program histogram: [6, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 04:07:16,973 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 04:07:16,975 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 04:07:16,978 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 04:07:16,987 INFO L163 areAnnotationChecker]: CFG has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 04:07:16,998 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 04:07:16 BoogieIcfgContainer [2022-04-28 04:07:16,998 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 04:07:17,000 INFO L158 Benchmark]: Toolchain (without parser) took 23199.27ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 119.9MB in the beginning and 193.3MB in the end (delta: -73.4MB). Peak memory consumption was 117.1MB. Max. memory is 8.0GB. [2022-04-28 04:07:17,000 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 135.8MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 04:07:17,000 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.86ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 145.1MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-28 04:07:17,001 INFO L158 Benchmark]: Boogie Preprocessor took 35.96ms. Allocated memory is still 165.7MB. Free memory was 145.1MB in the beginning and 143.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 04:07:17,001 INFO L158 Benchmark]: RCFGBuilder took 219.28ms. Allocated memory is still 165.7MB. Free memory was 143.5MB in the beginning and 134.2MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-28 04:07:17,001 INFO L158 Benchmark]: TraceAbstraction took 22628.16ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 133.5MB in the beginning and 193.3MB in the end (delta: -59.7MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. [2022-04-28 04:07:17,004 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 165.7MB. Free memory was 135.8MB in the beginning and 135.8MB in the end (delta: 71.8kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.86ms. Allocated memory is still 165.7MB. Free memory was 119.7MB in the beginning and 145.1MB in the end (delta: -25.3MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 35.96ms. Allocated memory is still 165.7MB. Free memory was 145.1MB in the beginning and 143.7MB in the end (delta: 1.3MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 219.28ms. Allocated memory is still 165.7MB. Free memory was 143.5MB in the beginning and 134.2MB in the end (delta: 9.2MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 22628.16ms. Allocated memory was 165.7MB in the beginning and 239.1MB in the end (delta: 73.4MB). Free memory was 133.5MB in the beginning and 193.3MB in the end (delta: -59.7MB). Peak memory consumption was 131.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 26]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.5s, OverallIterations: 8, TraceHistogramMax: 6, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 179 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 179 mSDsluCounter, 216 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 133 mSDsCounter, 76 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 509 IncrementalHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 76 mSolverCounterUnsat, 83 mSDtfsCounter, 509 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 175 GetRequests, 78 SyntacticMatches, 12 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=7, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 8 MinimizatonAttempts, 27 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 18 LocationsWithAnnotation, 18 PreInvPairs, 51 NumberOfFragments, 252 HoareAnnotationTreeSize, 18 FomulaSimplifications, 1230 FormulaSimplificationTreeSizeReduction, 2.4s HoareSimplificationTime, 18 FomulaSimplificationsInter, 77 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: (((((((b == 1 && (a == 0 || 0 < a)) && a < 6) || ((b == 0 && (a == 0 || 0 < a)) && a < 6)) || ((5 == b && (a == 0 || 0 < a)) && a < 6)) || ((b == 6 && (a == 0 || 0 < a)) && a < 6)) || ((b == 2 && (a == 0 || 0 < a)) && a < 6)) || ((b == 3 && (a == 0 || 0 < a)) && a < 6)) || ((b == 4 && (a == 0 || 0 < a)) && a < 6) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: ((b == 6 && a < 7) && (a == 1 || 1 < a)) || (a == 0 && b == 6) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-28 04:07:17,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...