/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_1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 07:07:34,957 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 07:07:34,960 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 07:07:35,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 07:07:35,000 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 07:07:35,001 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 07:07:35,003 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 07:07:35,006 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 07:07:35,007 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 07:07:35,011 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 07:07:35,012 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 07:07:35,013 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 07:07:35,013 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 07:07:35,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 07:07:35,014 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 07:07:35,015 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 07:07:35,015 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 07:07:35,015 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 07:07:35,016 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 07:07:35,017 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 07:07:35,018 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 07:07:35,020 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 07:07:35,021 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 07:07:35,024 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 07:07:35,025 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 07:07:35,031 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 07:07:35,031 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 07:07:35,031 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 07:07:35,032 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 07:07:35,032 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 07:07:35,033 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 07:07:35,033 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 07:07:35,035 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 07:07:35,035 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 07:07:35,035 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 07:07:35,036 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 07:07:35,036 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 07:07:35,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 07:07:35,037 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 07:07:35,037 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 07:07:35,037 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 07:07:35,039 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 07:07:35,040 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 07:07:35,048 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 07:07:35,048 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 07:07:35,049 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 07:07:35,049 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 07:07:35,049 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 07:07:35,049 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 07:07:35,050 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 07:07:35,050 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 07:07:35,050 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 07:07:35,050 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 07:07:35,050 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 07:07:35,051 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 07:07:35,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:35,051 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 07:07:35,052 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-15 07:07:35,253 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 07:07:35,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 07:07:35,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 07:07:35,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 07:07:35,284 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 07:07:35,285 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-15 07:07:35,334 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278358c7a/4985f2d644a540dda66db867e0a55a5a/FLAG1e6301727 [2022-04-15 07:07:35,650 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 07:07:35,650 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/nested_1.c [2022-04-15 07:07:35,653 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278358c7a/4985f2d644a540dda66db867e0a55a5a/FLAG1e6301727 [2022-04-15 07:07:36,097 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/278358c7a/4985f2d644a540dda66db867e0a55a5a [2022-04-15 07:07:36,099 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 07:07:36,101 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 07:07:36,102 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:36,102 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 07:07:36,117 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 07:07:36,118 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,118 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13cdd094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36, skipping insertion in model container [2022-04-15 07:07:36,118 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,124 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 07:07:36,131 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 07:07:36,271 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_1.c[676,689] [2022-04-15 07:07:36,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:36,292 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 07:07:36,299 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_1.c[676,689] [2022-04-15 07:07:36,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 07:07:36,308 INFO L208 MainTranslator]: Completed translation [2022-04-15 07:07:36,309 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36 WrapperNode [2022-04-15 07:07:36,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 07:07:36,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 07:07:36,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 07:07:36,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 07:07:36,316 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,316 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,320 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,320 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,323 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,325 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,325 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,326 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 07:07:36,327 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 07:07:36,327 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 07:07:36,327 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 07:07:36,327 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (1/1) ... [2022-04-15 07:07:36,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 07:07:36,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 07:07:36,348 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-15 07:07:36,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-15 07:07:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 07:07:36,387 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 07:07:36,388 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 07:07:36,388 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 07:07:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 07:07:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 07:07:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 07:07:36,388 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 07:07:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 07:07:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 07:07:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 07:07:36,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 07:07:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 07:07:36,390 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 07:07:36,440 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 07:07:36,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 07:07:36,570 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 07:07:36,576 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 07:07:36,576 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 07:07:36,577 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:36 BoogieIcfgContainer [2022-04-15 07:07:36,578 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 07:07:36,579 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 07:07:36,579 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 07:07:36,604 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 07:07:36,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 07:07:36" (1/3) ... [2022-04-15 07:07:36,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48db24c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:36, skipping insertion in model container [2022-04-15 07:07:36,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 07:07:36" (2/3) ... [2022-04-15 07:07:36,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48db24c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 07:07:36, skipping insertion in model container [2022-04-15 07:07:36,606 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 07:07:36" (3/3) ... [2022-04-15 07:07:36,607 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_1.c [2022-04-15 07:07:36,610 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 07:07:36,611 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 07:07:36,653 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 07:07:36,659 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-15 07:07:36,659 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 07:07:36,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-15 07:07:36,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:36,687 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:36,687 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:36,688 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:36,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:36,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 1 times [2022-04-15 07:07:36,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:36,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [292357871] [2022-04-15 07:07:36,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1887993331, now seen corresponding path program 2 times [2022-04-15 07:07:36,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:36,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243645401] [2022-04-15 07:07:36,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:36,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:36,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:36,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:36,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:36,892 INFO L290 TraceCheckUtils]: 0: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-15 07:07:36,892 INFO L290 TraceCheckUtils]: 1: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-15 07:07:36,893 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-15 07:07:36,894 INFO L272 TraceCheckUtils]: 0: Hoare triple {19#true} call ULTIMATE.init(); {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:36,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {19#true} is VALID [2022-04-15 07:07:36,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {19#true} assume true; {19#true} is VALID [2022-04-15 07:07:36,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19#true} {19#true} #32#return; {19#true} is VALID [2022-04-15 07:07:36,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {19#true} call #t~ret5 := main(); {19#true} is VALID [2022-04-15 07:07:36,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {19#true} ~a~0 := 6;~a~0 := 0; {19#true} is VALID [2022-04-15 07:07:36,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {19#true} assume !true; {20#false} is VALID [2022-04-15 07:07:36,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {20#false} assume !(6 == ~a~0); {20#false} is VALID [2022-04-15 07:07:36,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {20#false} assume !false; {20#false} is VALID [2022-04-15 07:07:36,898 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:36,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:36,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243645401] [2022-04-15 07:07:36,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243645401] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:36,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:36,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:36,905 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:36,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [292357871] [2022-04-15 07:07:36,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [292357871] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:36,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:36,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 07:07:36,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850706046] [2022-04-15 07:07:36,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:36,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 07:07:36,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:36,914 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:36,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:36,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 07:07:36,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:36,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 07:07:36,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:07:36,953 INFO L87 Difference]: Start difference. First operand has 16 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,002 INFO L93 Difference]: Finished difference Result 24 states and 26 transitions. [2022-04-15 07:07:37,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 07:07:37,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 07:07:37,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:37,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-15 07:07:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-04-15 07:07:37,015 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-04-15 07:07:37,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,066 INFO L225 Difference]: With dead ends: 24 [2022-04-15 07:07:37,066 INFO L226 Difference]: Without dead ends: 11 [2022-04-15 07:07:37,069 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 07:07:37,074 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 9 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:37,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 19 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:37,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-04-15 07:07:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2022-04-15 07:07:37,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:37,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,103 INFO L74 IsIncluded]: Start isIncluded. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,105 INFO L87 Difference]: Start difference. First operand 11 states. Second operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,111 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-15 07:07:37,111 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 07:07:37,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-15 07:07:37,113 INFO L87 Difference]: Start difference. First operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 11 states. [2022-04-15 07:07:37,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,118 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2022-04-15 07:07:37,118 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 07:07:37,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:37,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:37,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2022-04-15 07:07:37,122 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2022-04-15 07:07:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:37,123 INFO L478 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2022-04-15 07:07:37,123 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 11 transitions. [2022-04-15 07:07:37,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,138 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2022-04-15 07:07:37,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-04-15 07:07:37,139 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:37,139 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:37,139 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 07:07:37,140 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:37,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:37,143 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 1 times [2022-04-15 07:07:37,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:37,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [799230483] [2022-04-15 07:07:37,150 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 07:07:37,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1887999097, now seen corresponding path program 2 times [2022-04-15 07:07:37,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:37,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870969431] [2022-04-15 07:07:37,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:37,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:37,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:37,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:37,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:37,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-15 07:07:37,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-15 07:07:37,236 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-15 07:07:37,237 INFO L272 TraceCheckUtils]: 0: Hoare triple {119#true} call ULTIMATE.init(); {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:37,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {119#true} is VALID [2022-04-15 07:07:37,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#true} assume true; {119#true} is VALID [2022-04-15 07:07:37,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {119#true} {119#true} #32#return; {119#true} is VALID [2022-04-15 07:07:37,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {119#true} call #t~ret5 := main(); {119#true} is VALID [2022-04-15 07:07:37,239 INFO L290 TraceCheckUtils]: 5: Hoare triple {119#true} ~a~0 := 6;~a~0 := 0; {124#(= main_~a~0 0)} is VALID [2022-04-15 07:07:37,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {124#(= main_~a~0 0)} assume !(~a~0 < 6); {120#false} is VALID [2022-04-15 07:07:37,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {120#false} assume !(6 == ~a~0); {120#false} is VALID [2022-04-15 07:07:37,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {120#false} assume !false; {120#false} is VALID [2022-04-15 07:07:37,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:37,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:37,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870969431] [2022-04-15 07:07:37,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870969431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:37,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:37,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:37,241 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:37,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [799230483] [2022-04-15 07:07:37,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [799230483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:37,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:37,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 07:07:37,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233254859] [2022-04-15 07:07:37,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:37,242 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 07:07:37,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:37,242 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,255 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 07:07:37,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:37,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 07:07:37,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 07:07:37,256 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,310 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-15 07:07:37,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 07:07:37,311 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 9 [2022-04-15 07:07:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-15 07:07:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 16 transitions. [2022-04-15 07:07:37,313 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 16 transitions. [2022-04-15 07:07:37,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,335 INFO L225 Difference]: With dead ends: 16 [2022-04-15 07:07:37,335 INFO L226 Difference]: Without dead ends: 13 [2022-04-15 07:07:37,335 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 07:07:37,337 INFO L913 BasicCegarLoop]: 9 mSDtfsCounter, 8 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:37,338 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 16 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:37,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2022-04-15 07:07:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 12. [2022-04-15 07:07:37,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:37,349 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,349 INFO L74 IsIncluded]: Start isIncluded. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,349 INFO L87 Difference]: Start difference. First operand 13 states. Second operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,350 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 07:07:37,350 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 07:07:37,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 07:07:37,350 INFO L87 Difference]: Start difference. First operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 13 states. [2022-04-15 07:07:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,351 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 07:07:37,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-04-15 07:07:37,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,352 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,352 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:37,352 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:37,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-04-15 07:07:37,354 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2022-04-15 07:07:37,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:37,354 INFO L478 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-04-15 07:07:37,354 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,354 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 12 transitions. [2022-04-15 07:07:37,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,366 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-04-15 07:07:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-15 07:07:37,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 07:07:37,366 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 07:07:37,367 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 07:07:37,367 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 07:07:37,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 07:07:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash -1889274843, now seen corresponding path program 1 times [2022-04-15 07:07:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:37,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603794493] [2022-04-15 07:07:37,585 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-15 07:07:37,587 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 07:07:37,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1602266855, now seen corresponding path program 1 times [2022-04-15 07:07:37,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 07:07:37,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790325195] [2022-04-15 07:07:37,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 07:07:37,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 07:07:37,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:37,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 07:07:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 07:07:37,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-15 07:07:37,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-15 07:07:37,657 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-15 07:07:37,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {212#true} call ULTIMATE.init(); {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 07:07:37,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {220#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(11, 2);call #Ultimate.allocInit(12, 3); {212#true} is VALID [2022-04-15 07:07:37,664 INFO L290 TraceCheckUtils]: 2: Hoare triple {212#true} assume true; {212#true} is VALID [2022-04-15 07:07:37,664 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {212#true} {212#true} #32#return; {212#true} is VALID [2022-04-15 07:07:37,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {212#true} call #t~ret5 := main(); {212#true} is VALID [2022-04-15 07:07:37,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {212#true} ~a~0 := 6;~a~0 := 0; {217#(= main_~a~0 0)} is VALID [2022-04-15 07:07:37,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {217#(= main_~a~0 0)} [36] L19-3-->L19-4_primed: Formula: (let ((.cse0 (= |v_main_#t~pre4_4| |v_main_#t~pre4_3|))) (or (and (not (< v_main_~a~0_10 6)) .cse0 (= v_main_~a~0_9 v_main_~a~0_10)) (and (< v_main_~a~0_9 7) (< v_main_~a~0_10 v_main_~a~0_9)) (and .cse0 (= v_main_~a~0_10 v_main_~a~0_9)))) InVars {main_#t~pre4=|v_main_#t~pre4_4|, main_~a~0=v_main_~a~0_10} OutVars{main_#t~pre4=|v_main_#t~pre4_3|, main_~a~0=v_main_~a~0_9} AuxVars[] AssignedVars[main_#t~pre4, main_~a~0] {218#(<= main_~a~0 6)} is VALID [2022-04-15 07:07:37,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#(<= main_~a~0 6)} [35] L19-4_primed-->L19-4: Formula: (not (< v_main_~a~0_7 6)) InVars {main_~a~0=v_main_~a~0_7} OutVars{main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[] {219#(= main_~a~0 6)} is VALID [2022-04-15 07:07:37,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {219#(= main_~a~0 6)} assume !(6 == ~a~0); {213#false} is VALID [2022-04-15 07:07:37,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {213#false} assume !false; {213#false} is VALID [2022-04-15 07:07:37,667 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 07:07:37,667 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 07:07:37,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790325195] [2022-04-15 07:07:37,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790325195] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:37,669 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:37,669 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 07:07:37,738 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 07:07:37,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603794493] [2022-04-15 07:07:37,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603794493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 07:07:37,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 07:07:37,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 07:07:37,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675594583] [2022-04-15 07:07:37,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 07:07:37,739 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:07:37,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 07:07:37,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,749 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 07:07:37,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 07:07:37,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 07:07:37,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-04-15 07:07:37,750 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,868 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2022-04-15 07:07:37,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 07:07:37,868 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-15 07:07:37,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 07:07:37,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-15 07:07:37,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 13 transitions. [2022-04-15 07:07:37,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 13 transitions. [2022-04-15 07:07:37,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,882 INFO L225 Difference]: With dead ends: 13 [2022-04-15 07:07:37,882 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 07:07:37,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-04-15 07:07:37,885 INFO L913 BasicCegarLoop]: 6 mSDtfsCounter, 9 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 07:07:37,889 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 13 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 07:07:37,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 07:07:37,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 07:07:37,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 07:07:37,890 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:07:37,890 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:07:37,890 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:07:37,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,890 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:07:37,890 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:07:37,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:07:37,890 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 07:07:37,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 07:07:37,891 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 07:07:37,891 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:07:37,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 07:07:37,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 07:07:37,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 07:07:37,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 07:07:37,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 07:07:37,891 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 11 [2022-04-15 07:07:37,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 07:07:37,892 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 07:07:37,892 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 07:07:37,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-15 07:07:37,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 07:07:37,892 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 07:07:37,892 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 07:07:37,903 INFO L788 garLoopResultBuilder]: Registering result SAFE for location mainErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 07:07:37,903 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 07:07:37,905 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 07:07:37,972 INFO L882 garLoopResultBuilder]: For program point reach_errorEXIT(line 13) no Hoare annotation was computed. [2022-04-15 07:07:37,974 INFO L882 garLoopResultBuilder]: For program point reach_errorENTRY(line 13) no Hoare annotation was computed. [2022-04-15 07:07:37,974 INFO L882 garLoopResultBuilder]: For program point reach_errorFINAL(line 13) no Hoare annotation was computed. [2022-04-15 07:07:37,974 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,974 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 07:07:37,974 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,974 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,974 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,974 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,975 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-15 07:07:37,975 INFO L878 garLoopResultBuilder]: At program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 23) the Hoare annotation is: false [2022-04-15 07:07:37,975 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 15 26) the Hoare annotation is: true [2022-04-15 07:07:37,975 INFO L885 garLoopResultBuilder]: At program point mainEXIT(lines 15 26) the Hoare annotation is: true [2022-04-15 07:07:37,975 INFO L878 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: false [2022-04-15 07:07:37,975 INFO L885 garLoopResultBuilder]: At program point L22-1(lines 22 24) the Hoare annotation is: true [2022-04-15 07:07:37,975 INFO L878 garLoopResultBuilder]: At program point L19-2(lines 19 21) the Hoare annotation is: (and (or (= main_~a~0 0) (< 0 main_~a~0)) (< main_~a~0 6)) [2022-04-15 07:07:37,975 INFO L878 garLoopResultBuilder]: At program point L19-3(lines 19 21) the Hoare annotation is: (or (= main_~a~0 0) (and (< main_~a~0 7) (or (= main_~a~0 1) (< 1 main_~a~0)))) [2022-04-15 07:07:37,975 INFO L878 garLoopResultBuilder]: At program point L19-4(lines 15 26) the Hoare annotation is: (= main_~a~0 6) [2022-04-15 07:07:37,975 INFO L885 garLoopResultBuilder]: At program point mainFINAL(lines 15 26) the Hoare annotation is: true [2022-04-15 07:07:37,978 INFO L719 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1] [2022-04-15 07:07:37,978 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 07:07:37,982 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-15 07:07:37,983 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-15 07:07:37,987 INFO L163 areAnnotationChecker]: CFG has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 07:07:37,994 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 07:07:37 BoogieIcfgContainer [2022-04-15 07:07:37,994 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 07:07:37,995 INFO L158 Benchmark]: Toolchain (without parser) took 1893.81ms. Allocated memory was 183.5MB in the beginning and 248.5MB in the end (delta: 65.0MB). Free memory was 136.8MB in the beginning and 203.6MB in the end (delta: -66.8MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:07:37,995 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 183.5MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 07:07:37,995 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 183.5MB. Free memory was 136.6MB in the beginning and 162.3MB in the end (delta: -25.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 07:07:37,995 INFO L158 Benchmark]: Boogie Preprocessor took 16.65ms. Allocated memory is still 183.5MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 07:07:37,995 INFO L158 Benchmark]: RCFGBuilder took 251.14ms. Allocated memory is still 183.5MB. Free memory was 160.7MB in the beginning and 151.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-15 07:07:37,996 INFO L158 Benchmark]: TraceAbstraction took 1414.80ms. Allocated memory was 183.5MB in the beginning and 248.5MB in the end (delta: 65.0MB). Free memory was 150.7MB in the beginning and 203.6MB in the end (delta: -52.9MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-15 07:07:37,997 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.13ms. Allocated memory is still 183.5MB. Free memory is still 153.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 207.13ms. Allocated memory is still 183.5MB. Free memory was 136.6MB in the beginning and 162.3MB in the end (delta: -25.7MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 16.65ms. Allocated memory is still 183.5MB. Free memory was 162.3MB in the beginning and 160.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 251.14ms. Allocated memory is still 183.5MB. Free memory was 160.7MB in the beginning and 151.3MB in the end (delta: 9.4MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1414.80ms. Allocated memory was 183.5MB in the beginning and 248.5MB in the end (delta: 65.0MB). Free memory was 150.7MB in the beginning and 203.6MB in the end (delta: -52.9MB). Peak memory consumption was 12.7MB. 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: 23]: 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, 19 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 3, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 26 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 26 mSDsluCounter, 48 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24 IncrementalHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 31 mSDtfsCounter, 24 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 26 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=16occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 16 LocationsWithAnnotation, 16 PreInvPairs, 24 NumberOfFragments, 48 HoareAnnotationTreeSize, 16 FomulaSimplifications, 12 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 16 FomulaSimplificationsInter, 12 FormulaSimplificationTreeSizeReductionInter, 0.0s 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: 19]: Loop Invariant Derived loop invariant: a == 0 || (a < 7 && (a == 1 || 1 < a)) - ProcedureContractResult [Line: 15]: Procedure Contract for main Derived contract for procedure main: 1 RESULT: Ultimate proved your program to be correct! [2022-04-15 07:07:38,033 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...