/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/loops-crafted-1/nested_delay_notd2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:10:05,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:10:05,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:10:05,808 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:10:05,809 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:10:05,809 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:10:05,810 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:10:05,811 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:10:05,812 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:10:05,812 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:10:05,813 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:10:05,815 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:10:05,815 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:10:05,818 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:10:05,819 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:10:05,819 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:10:05,820 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:10:05,820 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:10:05,821 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:10:05,822 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:10:05,823 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:10:05,823 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:10:05,824 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:10:05,824 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:10:05,825 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:10:05,826 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:10:05,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:10:05,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:10:05,827 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:10:05,827 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:10:05,828 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:10:05,828 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:10:05,828 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:10:05,829 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:10:05,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:10:05,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:10:05,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:10:05,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:10:05,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:10:05,832 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:10:05,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:10:05,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:10:05,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 04:10:05,839 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:10:05,839 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:10:05,840 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:10:05,840 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:10:05,840 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:10:05,840 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:10:05,840 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:10:05,841 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:10:05,841 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:10:05,842 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:10:05,842 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:10:05,843 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:10:05,843 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-08 04:10:06,023 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:10:06,050 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:10:06,052 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:10:06,052 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:10:06,053 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:10:06,054 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-08 04:10:06,109 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078c7eefe/6fec94705411473c87a9864d0bd75b1e/FLAGb0f0d1200 [2022-04-08 04:10:06,404 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:10:06,405 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c [2022-04-08 04:10:06,414 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078c7eefe/6fec94705411473c87a9864d0bd75b1e/FLAGb0f0d1200 [2022-04-08 04:10:06,856 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/078c7eefe/6fec94705411473c87a9864d0bd75b1e [2022-04-08 04:10:06,858 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:10:06,859 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:10:06,862 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:10:06,862 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:10:06,864 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:10:06,865 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:10:06" (1/1) ... [2022-04-08 04:10:06,866 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fd1e574 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:06, skipping insertion in model container [2022-04-08 04:10:06,866 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:10:06" (1/1) ... [2022-04-08 04:10:06,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:10:06,884 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:10:07,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-08 04:10:07,156 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:10:07,161 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:10:07,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/nested_delay_notd2.c[468,481] [2022-04-08 04:10:07,198 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:10:07,208 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:10:07,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07 WrapperNode [2022-04-08 04:10:07,209 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:10:07,215 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:10:07,215 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:10:07,215 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:10:07,242 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,242 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,253 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,254 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:10:07,255 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:10:07,255 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:10:07,255 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:10:07,265 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (1/1) ... [2022-04-08 04:10:07,278 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:10:07,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:10:07,341 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-08 04:10:07,385 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-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:10:07,412 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:10:07,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:10:07,485 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:10:07,486 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:10:07,690 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:10:07,695 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:10:07,695 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:10:07,696 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:10:07 BoogieIcfgContainer [2022-04-08 04:10:07,696 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:10:07,697 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:10:07,697 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:10:07,699 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:10:07,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:10:06" (1/3) ... [2022-04-08 04:10:07,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6155d868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:10:07, skipping insertion in model container [2022-04-08 04:10:07,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:10:07" (2/3) ... [2022-04-08 04:10:07,700 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6155d868 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:10:07, skipping insertion in model container [2022-04-08 04:10:07,700 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:10:07" (3/3) ... [2022-04-08 04:10:07,701 INFO L111 eAbstractionObserver]: Analyzing ICFG nested_delay_notd2.c [2022-04-08 04:10:07,704 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:10:07,704 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:10:07,729 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:10:07,733 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-08 04:10:07,733 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:10:07,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 04:10:07,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:10:07,748 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:10:07,748 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:10:07,749 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:10:07,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:10:07,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 1 times [2022-04-08 04:10:07,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:07,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044480493] [2022-04-08 04:10:07,763 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:10:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1039138334, now seen corresponding path program 2 times [2022-04-08 04:10:07,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:10:07,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164457064] [2022-04-08 04:10:07,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:10:07,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:10:07,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:07,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:10:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:07,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {35#true} is VALID [2022-04-08 04:10:07,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 04:10:07,934 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-08 04:10:07,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:10:07,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:07,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:10:07,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:10:07,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:10:07,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-08 04:10:07,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:10:07,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {35#true} is VALID [2022-04-08 04:10:07,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 04:10:07,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #90#return; {35#true} is VALID [2022-04-08 04:10:07,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-08 04:10:07,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {35#true} is VALID [2022-04-08 04:10:07,972 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {35#true} is VALID [2022-04-08 04:10:07,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 04:10:07,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 04:10:07,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 04:10:07,973 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #86#return; {36#false} is VALID [2022-04-08 04:10:07,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {36#false} is VALID [2022-04-08 04:10:07,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !false;~st~0 := 1;~c~0 := 0; {36#false} is VALID [2022-04-08 04:10:07,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-08 04:10:07,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {36#false} is VALID [2022-04-08 04:10:07,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {36#false} is VALID [2022-04-08 04:10:07,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {36#false} is VALID [2022-04-08 04:10:07,974 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {36#false} is VALID [2022-04-08 04:10:07,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 04:10:07,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 04:10:07,987 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 04:10:07,988 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-08 04:10:07,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:10:07,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164457064] [2022-04-08 04:10:07,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164457064] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:07,989 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:07,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:10:07,991 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:10:07,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044480493] [2022-04-08 04:10:07,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044480493] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:07,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:07,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 04:10:07,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822920015] [2022-04-08 04:10:07,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:10:07,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 04:10:08,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:10:08,010 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:10:08,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:08,110 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 04:10:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:08,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 04:10:08,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 04:10:08,136 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 24 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:10:08,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:08,234 INFO L93 Difference]: Finished difference Result 50 states and 71 transitions. [2022-04-08 04:10:08,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 04:10:08,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-08 04:10:08,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:10:08,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:10:08,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 04:10:08,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:10:08,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-04-08 04:10:08,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-04-08 04:10:08,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:08,407 INFO L225 Difference]: With dead ends: 50 [2022-04-08 04:10:08,407 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 04:10:08,409 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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-08 04:10:08,414 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 8 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 04:10:08,416 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 35 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 04:10:08,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 04:10:08,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 04:10:08,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:10:08,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:08,453 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:08,454 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:08,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:08,456 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 04:10:08,456 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 04:10:08,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:08,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:08,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:10:08,462 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-08 04:10:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:08,464 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2022-04-08 04:10:08,464 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 04:10:08,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:08,465 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:08,465 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:10:08,465 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:10:08,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 19 states have (on average 1.368421052631579) internal successors, (26), 20 states have internal predecessors, (26), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:08,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-08 04:10:08,468 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 21 [2022-04-08 04:10:08,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:10:08,468 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-08 04:10:08,468 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 04:10:08,468 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-08 04:10:08,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:08,501 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 04:10:08,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-08 04:10:08,501 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:10:08,502 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:10:08,502 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:10:08,502 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:10:08,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:10:08,506 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 1 times [2022-04-08 04:10:08,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:08,507 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [298427953] [2022-04-08 04:10:08,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:10:08,510 INFO L85 PathProgramCache]: Analyzing trace with hash 677978447, now seen corresponding path program 2 times [2022-04-08 04:10:08,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:10:08,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747611404] [2022-04-08 04:10:08,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:10:08,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:10:08,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:10:08,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:08,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,702 INFO L290 TraceCheckUtils]: 1: Hoare triple {260#(<= 20 ~SIZE~0)} assume true; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,703 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {260#(<= 20 ~SIZE~0)} {255#true} #90#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 04:10:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:10:08,722 INFO L290 TraceCheckUtils]: 0: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-08 04:10:08,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-08 04:10:08,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-08 04:10:08,723 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {255#true} {260#(<= 20 ~SIZE~0)} #86#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,724 INFO L272 TraceCheckUtils]: 0: Hoare triple {255#true} call ULTIMATE.init(); {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:10:08,726 INFO L290 TraceCheckUtils]: 1: Hoare triple {266#(and (= ~last~0 |old(~last~0)|) (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(21, 2);call #Ultimate.allocInit(12, 3);~last~0 := 0;~SIZE~0 := 20; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,726 INFO L290 TraceCheckUtils]: 2: Hoare triple {260#(<= 20 ~SIZE~0)} assume true; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,727 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {260#(<= 20 ~SIZE~0)} {255#true} #90#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,727 INFO L272 TraceCheckUtils]: 4: Hoare triple {260#(<= 20 ~SIZE~0)} call #t~ret7 := main(); {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,743 INFO L290 TraceCheckUtils]: 5: Hoare triple {260#(<= 20 ~SIZE~0)} assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~last~0 := #t~nondet4;havoc #t~nondet4; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,744 INFO L272 TraceCheckUtils]: 6: Hoare triple {260#(<= 20 ~SIZE~0)} call assume_abort_if_not((if ~last~0 > 0 then 1 else 0)); {255#true} is VALID [2022-04-08 04:10:08,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {255#true} ~cond := #in~cond; {255#true} is VALID [2022-04-08 04:10:08,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {255#true} assume !(0 == ~cond); {255#true} is VALID [2022-04-08 04:10:08,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {255#true} assume true; {255#true} is VALID [2022-04-08 04:10:08,746 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {255#true} {260#(<= 20 ~SIZE~0)} #86#return; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {260#(<= 20 ~SIZE~0)} ~a~0 := 0;~b~0 := 0;~c~0 := 0;~st~0 := 0;~d~0 := 0; {260#(<= 20 ~SIZE~0)} is VALID [2022-04-08 04:10:08,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {260#(<= 20 ~SIZE~0)} assume !false;~st~0 := 1;~c~0 := 0; {265#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} is VALID [2022-04-08 04:10:08,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {265#(and (<= 20 ~SIZE~0) (= main_~c~0 0))} assume !(~c~0 < ~SIZE~0); {256#false} is VALID [2022-04-08 04:10:08,754 INFO L290 TraceCheckUtils]: 14: Hoare triple {256#false} assume 0 == ~st~0 && ~c~0 == 1 + ~last~0;~a~0 := 3 + ~a~0;~b~0 := 3 + ~b~0; {256#false} is VALID [2022-04-08 04:10:08,754 INFO L290 TraceCheckUtils]: 15: Hoare triple {256#false} assume ~c~0 == ~last~0 && 0 == ~st~0;~a~0 := 1 + ~a~0; {256#false} is VALID [2022-04-08 04:10:08,754 INFO L290 TraceCheckUtils]: 16: Hoare triple {256#false} assume ~d~0 == ~SIZE~0;~a~0 := 0;~b~0 := 1; {256#false} is VALID [2022-04-08 04:10:08,754 INFO L272 TraceCheckUtils]: 17: Hoare triple {256#false} call __VERIFIER_assert((if ~a~0 == ~b~0 && ~c~0 == ~SIZE~0 then 1 else 0)); {256#false} is VALID [2022-04-08 04:10:08,754 INFO L290 TraceCheckUtils]: 18: Hoare triple {256#false} ~cond := #in~cond; {256#false} is VALID [2022-04-08 04:10:08,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {256#false} assume 0 == ~cond; {256#false} is VALID [2022-04-08 04:10:08,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {256#false} assume !false; {256#false} is VALID [2022-04-08 04:10:08,755 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-08 04:10:08,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:10:08,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747611404] [2022-04-08 04:10:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747611404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:08,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:10:08,756 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:10:08,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [298427953] [2022-04-08 04:10:08,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [298427953] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:10:08,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:10:08,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:10:08,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023970546] [2022-04-08 04:10:08,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:10:08,757 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 04:10:08,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:10:08,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:10:08,786 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:08,787 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:10:08,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:08,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:10:08,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:10:08,788 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:10:09,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:09,049 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 04:10:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:10:09,050 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-04-08 04:10:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:10:09,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:10:09,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 04:10:09,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:10:09,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2022-04-08 04:10:09,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2022-04-08 04:10:09,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:10:09,147 INFO L225 Difference]: With dead ends: 46 [2022-04-08 04:10:09,147 INFO L226 Difference]: Without dead ends: 31 [2022-04-08 04:10:09,148 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:10:09,152 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 39 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:10:09,152 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:10:09,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-08 04:10:09,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2022-04-08 04:10:09,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:10:09,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:09,189 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:09,191 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:09,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:09,193 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-08 04:10:09,194 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 04:10:09,194 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:09,194 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:09,195 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-08 04:10:09,195 INFO L87 Difference]: Start difference. First operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 31 states. [2022-04-08 04:10:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:10:09,200 INFO L93 Difference]: Finished difference Result 31 states and 38 transitions. [2022-04-08 04:10:09,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-04-08 04:10:09,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:10:09,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:10:09,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:10:09,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:10:09,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:10:09,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-04-08 04:10:09,204 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 21 [2022-04-08 04:10:09,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:10:09,206 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-04-08 04:10:09,207 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 3 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:10:09,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 34 transitions. [2022-04-08 04:10:09,240 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-08 04:10:09,240 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 04:10:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 04:10:09,241 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:10:09,242 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:10:09,242 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 04:10:09,242 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:10:09,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:10:09,243 INFO L85 PathProgramCache]: Analyzing trace with hash -673447056, now seen corresponding path program 1 times [2022-04-08 04:10:09,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:10:09,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227462746] [2022-04-08 04:10:09,651 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {0={1=1}, 1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 04:10:09,653 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post5_4|, v_main_~st~0_11] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 04:10:09,656 INFO L158 Benchmark]: Toolchain (without parser) took 2796.07ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 144.8MB in the beginning and 148.5MB in the end (delta: -3.7MB). Peak memory consumption was 35.6MB. Max. memory is 8.0GB. [2022-04-08 04:10:09,656 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 197.1MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:10:09,656 INFO L158 Benchmark]: CACSL2BoogieTranslator took 352.70ms. Allocated memory is still 197.1MB. Free memory was 144.5MB in the beginning and 171.4MB in the end (delta: -26.9MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-04-08 04:10:09,656 INFO L158 Benchmark]: Boogie Preprocessor took 39.85ms. Allocated memory is still 197.1MB. Free memory was 171.4MB in the beginning and 170.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 04:10:09,657 INFO L158 Benchmark]: RCFGBuilder took 441.05ms. Allocated memory is still 197.1MB. Free memory was 170.0MB in the beginning and 157.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-08 04:10:09,657 INFO L158 Benchmark]: TraceAbstraction took 1957.76ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 157.4MB in the beginning and 148.5MB in the end (delta: 8.9MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. [2022-04-08 04:10:09,658 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.10ms. Allocated memory is still 197.1MB. Free memory is still 160.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 352.70ms. Allocated memory is still 197.1MB. Free memory was 144.5MB in the beginning and 171.4MB in the end (delta: -26.9MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Preprocessor took 39.85ms. Allocated memory is still 197.1MB. Free memory was 171.4MB in the beginning and 170.0MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 441.05ms. Allocated memory is still 197.1MB. Free memory was 170.0MB in the beginning and 157.8MB in the end (delta: 12.2MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1957.76ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 157.4MB in the beginning and 148.5MB in the end (delta: 8.9MB). Peak memory consumption was 48.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post5_4|, v_main_~st~0_11] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post5_4|, v_main_~st~0_11]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 04:10:09,681 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...