/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-invgen/NetBSD_loop.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:50:38,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:50:38,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:50:38,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:50:38,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:50:38,063 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:50:38,065 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:50:38,070 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:50:38,072 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:50:38,077 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:50:38,078 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:50:38,079 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:50:38,079 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:50:38,081 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:50:38,082 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:50:38,085 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:50:38,085 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:50:38,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:50:38,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:50:38,093 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:50:38,095 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:50:38,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:50:38,097 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:50:38,098 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:50:38,099 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:50:38,105 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:50:38,106 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:50:38,106 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:50:38,107 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:50:38,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:50:38,109 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:50:38,109 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:50:38,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:50:38,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:50:38,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:50:38,112 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:50:38,112 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:50:38,113 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:50:38,113 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:50:38,113 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:50:38,114 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:50:38,115 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:50:38,116 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 03:50:38,124 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:50:38,125 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:50:38,126 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:50:38,126 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:50:38,126 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:50:38,127 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:50:38,127 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:50:38,127 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:50:38,127 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:50:38,128 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:50:38,128 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:50:38,128 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:50:38,129 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:50:38,129 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:50:38,130 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:50:38,130 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:50:38,130 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:50:38,130 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:50:38,130 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:50:38,130 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:50:38,131 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 03:50:38,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:50:38,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:50:38,397 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:50:38,398 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:50:38,399 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:50:38,400 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-08 03:50:38,466 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964725240/47d89110207f4b9385feb572a715779e/FLAGa0307a669 [2022-04-08 03:50:38,904 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:50:38,905 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/NetBSD_loop.i [2022-04-08 03:50:38,912 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964725240/47d89110207f4b9385feb572a715779e/FLAGa0307a669 [2022-04-08 03:50:38,933 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/964725240/47d89110207f4b9385feb572a715779e [2022-04-08 03:50:38,935 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:50:38,937 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:50:38,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:50:38,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:50:38,943 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:50:38,945 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:38" (1/1) ... [2022-04-08 03:50:38,946 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c0ef12e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:38, skipping insertion in model container [2022-04-08 03:50:38,946 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:50:38" (1/1) ... [2022-04-08 03:50:38,952 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:50:38,966 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:50:39,152 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-invgen/NetBSD_loop.i[893,906] [2022-04-08 03:50:39,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:50:39,192 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:50:39,207 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-invgen/NetBSD_loop.i[893,906] [2022-04-08 03:50:39,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:50:39,235 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:50:39,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39 WrapperNode [2022-04-08 03:50:39,237 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:50:39,238 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:50:39,238 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:50:39,238 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:50:39,248 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,255 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,256 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,278 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:50:39,286 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:50:39,286 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:50:39,287 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:50:39,287 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (1/1) ... [2022-04-08 03:50:39,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:50:39,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:50:39,321 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 03:50:39,344 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 03:50:39,366 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:50:39,367 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:50:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:50:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 03:50:39,371 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:50:39,372 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:50:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:50:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:50:39,372 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-08 03:50:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-08 03:50:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:50:39,373 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:50:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 03:50:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:50:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 03:50:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:50:39,374 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:50:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:50:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:50:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:50:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:50:39,375 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:50:39,456 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:50:39,457 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:50:39,614 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:50:39,621 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:50:39,635 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:50:39,637 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:39 BoogieIcfgContainer [2022-04-08 03:50:39,637 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:50:39,639 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:50:39,639 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:50:39,658 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:50:39,658 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:50:38" (1/3) ... [2022-04-08 03:50:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114fd7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:39, skipping insertion in model container [2022-04-08 03:50:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:50:39" (2/3) ... [2022-04-08 03:50:39,659 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@114fd7a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:50:39, skipping insertion in model container [2022-04-08 03:50:39,659 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:50:39" (3/3) ... [2022-04-08 03:50:39,661 INFO L111 eAbstractionObserver]: Analyzing ICFG NetBSD_loop.i [2022-04-08 03:50:39,665 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:50:39,666 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:50:39,723 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:50:39,736 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 03:50:39,736 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:50:39,754 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:50:39,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 03:50:39,764 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:39,765 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:39,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:50:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:39,777 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 1 times [2022-04-08 03:50:39,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:39,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1449711735] [2022-04-08 03:50:39,794 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:39,794 INFO L85 PathProgramCache]: Analyzing trace with hash -390730657, now seen corresponding path program 2 times [2022-04-08 03:50:39,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:39,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398317065] [2022-04-08 03:50:39,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:39,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:39,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:40,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:40,116 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(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(9, 2); {26#true} is VALID [2022-04-08 03:50:40,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:50:40,117 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 03:50:40,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:40,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(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(9, 2); {26#true} is VALID [2022-04-08 03:50:40,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:50:40,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #61#return; {26#true} is VALID [2022-04-08 03:50:40,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret3 := main(); {26#true} is VALID [2022-04-08 03:50:40,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {26#true} is VALID [2022-04-08 03:50:40,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {26#true} is VALID [2022-04-08 03:50:40,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {26#true} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-08 03:50:40,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {31#(<= 0 main_~glob2_p_off~0)} is VALID [2022-04-08 03:50:40,127 INFO L272 TraceCheckUtils]: 9: Hoare triple {31#(<= 0 main_~glob2_p_off~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {32#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:50:40,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {32#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {33#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:50:40,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {27#false} is VALID [2022-04-08 03:50:40,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 03:50:40,131 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 03:50:40,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:40,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398317065] [2022-04-08 03:50:40,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398317065] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:40,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:40,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:40,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:40,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1449711735] [2022-04-08 03:50:40,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1449711735] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:40,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:40,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 03:50:40,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607317953] [2022-04-08 03:50:40,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:40,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:50:40,148 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:40,151 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:40,174 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-08 03:50:40,175 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 03:50:40,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:40,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 03:50:40,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 03:50:40,196 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:40,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:40,574 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-04-08 03:50:40,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 03:50:40,575 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 03:50:40,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:40,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:40,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 03:50:40,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:40,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 54 transitions. [2022-04-08 03:50:40,589 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 54 transitions. [2022-04-08 03:50:40,646 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:40,653 INFO L225 Difference]: With dead ends: 45 [2022-04-08 03:50:40,653 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 03:50:40,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 03:50:40,659 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:40,660 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:40,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 03:50:40,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-04-08 03:50:40,700 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:40,701 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 03:50:40,701 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 03:50:40,702 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 03:50:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:40,705 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 03:50:40,705 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 03:50:40,705 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:40,705 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:40,706 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states. [2022-04-08 03:50:40,706 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 22 states. [2022-04-08 03:50:40,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:40,709 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-08 03:50:40,709 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 03:50:40,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:40,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:40,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:40,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:40,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 03:50:40,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2022-04-08 03:50:40,714 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 13 [2022-04-08 03:50:40,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:40,714 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2022-04-08 03:50:40,714 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 4 states have internal predecessors, (9), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:50:40,715 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 22 transitions. [2022-04-08 03:50:40,741 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:40,741 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2022-04-08 03:50:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 03:50:40,742 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:40,742 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:40,742 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:50:40,743 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:50:40,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:40,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 1 times [2022-04-08 03:50:40,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:40,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1577854570] [2022-04-08 03:50:40,745 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:50:40,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1367367025, now seen corresponding path program 2 times [2022-04-08 03:50:40,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:50:40,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32165592] [2022-04-08 03:50:40,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:50:40,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:50:40,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:40,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:50:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:40,888 INFO L290 TraceCheckUtils]: 0: Hoare triple {236#(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(9, 2); {223#true} is VALID [2022-04-08 03:50:40,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-08 03:50:40,889 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-08 03:50:40,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-04-08 03:50:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:50:40,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-08 03:50:40,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-08 03:50:40,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-08 03:50:40,899 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-08 03:50:40,899 INFO L272 TraceCheckUtils]: 0: Hoare triple {223#true} call ULTIMATE.init(); {236#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:50:40,900 INFO L290 TraceCheckUtils]: 1: Hoare triple {236#(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(9, 2); {223#true} is VALID [2022-04-08 03:50:40,900 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-08 03:50:40,900 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {223#true} {223#true} #61#return; {223#true} is VALID [2022-04-08 03:50:40,900 INFO L272 TraceCheckUtils]: 4: Hoare triple {223#true} call #t~ret3 := main(); {223#true} is VALID [2022-04-08 03:50:40,900 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#true} havoc ~MAXPATHLEN~0;havoc ~pathbuf_off~0;havoc ~bound_off~0;havoc ~glob2_p_off~0;havoc ~glob2_pathbuf_off~0;havoc ~glob2_pathlim_off~0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~MAXPATHLEN~0 := #t~nondet1;havoc #t~nondet1; {223#true} is VALID [2022-04-08 03:50:40,901 INFO L290 TraceCheckUtils]: 6: Hoare triple {223#true} assume ~MAXPATHLEN~0 > 0 && ~MAXPATHLEN~0 < 2147483647; {228#(<= 1 main_~MAXPATHLEN~0)} is VALID [2022-04-08 03:50:40,902 INFO L290 TraceCheckUtils]: 7: Hoare triple {228#(<= 1 main_~MAXPATHLEN~0)} ~pathbuf_off~0 := 0;~bound_off~0 := ~pathbuf_off~0 + (1 + ~MAXPATHLEN~0) - 1;~glob2_pathbuf_off~0 := ~pathbuf_off~0;~glob2_pathlim_off~0 := ~bound_off~0;~glob2_p_off~0 := ~glob2_pathbuf_off~0; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-08 03:50:40,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} assume !!(~glob2_p_off~0 <= ~glob2_pathlim_off~0); {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-08 03:50:40,903 INFO L272 TraceCheckUtils]: 9: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if 0 <= ~glob2_p_off~0 then 1 else 0)); {223#true} is VALID [2022-04-08 03:50:40,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {223#true} ~cond := #in~cond; {223#true} is VALID [2022-04-08 03:50:40,903 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#true} assume !(0 == ~cond); {223#true} is VALID [2022-04-08 03:50:40,903 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#true} assume true; {223#true} is VALID [2022-04-08 03:50:40,904 INFO L284 TraceCheckUtils]: 13: Hoare quadruple {223#true} {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} #57#return; {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} is VALID [2022-04-08 03:50:40,905 INFO L272 TraceCheckUtils]: 14: Hoare triple {229#(<= (+ main_~glob2_p_off~0 1) main_~MAXPATHLEN~0)} call __VERIFIER_assert((if ~glob2_p_off~0 < 1 + ~MAXPATHLEN~0 then 1 else 0)); {234#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 03:50:40,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {234#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {235#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 03:50:40,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {235#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {224#false} is VALID [2022-04-08 03:50:40,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {224#false} assume !false; {224#false} is VALID [2022-04-08 03:50:40,906 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:50:40,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:50:40,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32165592] [2022-04-08 03:50:40,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32165592] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:40,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:40,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:40,908 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:50:40,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1577854570] [2022-04-08 03:50:40,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1577854570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:50:40,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:50:40,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 03:50:40,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558235371] [2022-04-08 03:50:40,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:50:40,911 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 03:50:40,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:50:40,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:40,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:40,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 03:50:40,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:40,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 03:50:40,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-04-08 03:50:40,929 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:41,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:41,246 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2022-04-08 03:50:41,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 03:50:41,246 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 03:50:41,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:50:41,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:41,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 03:50:41,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:41,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 30 transitions. [2022-04-08 03:50:41,255 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 30 transitions. [2022-04-08 03:50:41,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:41,292 INFO L225 Difference]: With dead ends: 32 [2022-04-08 03:50:41,293 INFO L226 Difference]: Without dead ends: 30 [2022-04-08 03:50:41,294 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 03:50:41,298 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 19 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 03:50:41,299 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 37 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 03:50:41,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-08 03:50:41,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2022-04-08 03:50:41,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:50:41,324 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:50:41,325 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:50:41,326 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:50:41,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:41,330 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:50:41,330 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:50:41,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:41,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:41,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 03:50:41,334 INFO L87 Difference]: Start difference. First operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 30 states. [2022-04-08 03:50:41,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:50:41,343 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-04-08 03:50:41,344 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-04-08 03:50:41,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:50:41,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:50:41,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:50:41,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:50:41,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 03:50:41,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2022-04-08 03:50:41,355 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 18 [2022-04-08 03:50:41,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:50:41,355 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2022-04-08 03:50:41,356 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 5 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:50:41,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 30 transitions. [2022-04-08 03:50:41,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:50:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-08 03:50:41,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 03:50:41,395 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:50:41,395 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:50:41,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:50:41,395 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:50:41,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:50:41,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1382920975, now seen corresponding path program 1 times [2022-04-08 03:50:41,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:50:41,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2042131792] [2022-04-08 03:50:45,891 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 03:50:46,172 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-04-08 03:50:46,175 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post2_4|] 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 03:50:46,189 INFO L158 Benchmark]: Toolchain (without parser) took 7252.39ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.8MB in the beginning and 102.0MB in the end (delta: 18.8MB). Peak memory consumption was 52.7MB. Max. memory is 8.0GB. [2022-04-08 03:50:46,190 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 172.0MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:50:46,190 INFO L158 Benchmark]: CACSL2BoogieTranslator took 297.37ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.6MB in the beginning and 183.0MB in the end (delta: -62.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-08 03:50:46,191 INFO L158 Benchmark]: Boogie Preprocessor took 47.95ms. Allocated memory is still 206.6MB. Free memory was 183.0MB in the beginning and 181.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 03:50:46,191 INFO L158 Benchmark]: RCFGBuilder took 351.28ms. Allocated memory is still 206.6MB. Free memory was 181.3MB in the beginning and 169.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 03:50:46,191 INFO L158 Benchmark]: TraceAbstraction took 6549.07ms. Allocated memory is still 206.6MB. Free memory was 169.0MB in the beginning and 102.0MB in the end (delta: 67.0MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. [2022-04-08 03:50:46,193 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.14ms. Allocated memory is still 172.0MB. Free memory is still 137.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 297.37ms. Allocated memory was 172.0MB in the beginning and 206.6MB in the end (delta: 34.6MB). Free memory was 120.6MB in the beginning and 183.0MB in the end (delta: -62.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 47.95ms. Allocated memory is still 206.6MB. Free memory was 183.0MB in the beginning and 181.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 351.28ms. Allocated memory is still 206.6MB. Free memory was 181.3MB in the beginning and 169.4MB in the end (delta: 11.9MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 6549.07ms. Allocated memory is still 206.6MB. Free memory was 169.0MB in the beginning and 102.0MB in the end (delta: 67.0MB). Peak memory consumption was 66.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post2_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post2_4|]: 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 03:50:46,222 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...