/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-simple/deep-nested.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:16:33,244 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:16:33,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:16:33,275 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:16:33,276 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:16:33,277 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:16:33,279 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:16:33,283 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:16:33,284 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:16:33,287 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:16:33,288 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:16:33,289 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:16:33,289 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:16:33,291 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:16:33,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:16:33,294 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:16:33,294 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:16:33,295 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:16:33,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:16:33,299 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:16:33,300 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:16:33,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:16:33,302 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:16:33,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:16:33,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:16:33,305 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:16:33,305 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:16:33,305 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:16:33,305 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:16:33,305 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:16:33,306 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:16:33,306 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:16:33,306 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:16:33,307 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:16:33,307 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:16:33,308 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:16:33,308 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:16:33,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:16:33,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:16:33,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:16:33,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:16:33,312 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:16:33,313 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:16:33,321 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:16:33,322 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:16:33,323 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:16:33,323 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:16:33,324 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:16:33,324 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:16:33,325 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:16:33,325 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:16:33,325 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:33,325 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:16:33,325 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:16:33,325 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:16:33,326 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:16:33,326 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:16:33,326 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:16:33,326 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:16:33,518 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:16:33,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:16:33,540 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:16:33,541 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:16:33,542 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:16:33,542 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-simple/deep-nested.c [2022-04-08 04:16:33,591 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac04d3/ca1026b8a20d496697e8abcdf14ac6ec/FLAG8e6e18c10 [2022-04-08 04:16:33,938 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:16:33,938 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/deep-nested.c [2022-04-08 04:16:33,944 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac04d3/ca1026b8a20d496697e8abcdf14ac6ec/FLAG8e6e18c10 [2022-04-08 04:16:34,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b2ac04d3/ca1026b8a20d496697e8abcdf14ac6ec [2022-04-08 04:16:34,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:16:34,375 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:16:34,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:34,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:16:34,379 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:16:34,380 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33bfd46d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34, skipping insertion in model container [2022-04-08 04:16:34,381 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:16:34,397 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:16:34,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/deep-nested.c[625,638] [2022-04-08 04:16:34,532 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:34,537 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:16:34,548 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-simple/deep-nested.c[625,638] [2022-04-08 04:16:34,549 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:16:34,557 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:16:34,557 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34 WrapperNode [2022-04-08 04:16:34,557 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:16:34,558 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:16:34,558 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:16:34,558 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:16:34,564 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,564 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,568 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,569 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,584 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:16:34,592 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:16:34,592 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:16:34,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:16:34,593 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (1/1) ... [2022-04-08 04:16:34,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:16:34,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:16:34,616 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:16:34,633 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:16:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:16:34,649 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:16:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:16:34,650 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:16:34,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:16:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:16:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:16:34,651 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:16:34,652 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:16:34,697 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:16:34,698 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:16:34,861 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:16:34,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:16:34,868 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-04-08 04:16:34,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:34 BoogieIcfgContainer [2022-04-08 04:16:34,869 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:16:34,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:16:34,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:16:34,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:16:34,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:16:34" (1/3) ... [2022-04-08 04:16:34,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff3d252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:34, skipping insertion in model container [2022-04-08 04:16:34,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:16:34" (2/3) ... [2022-04-08 04:16:34,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff3d252 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:16:34, skipping insertion in model container [2022-04-08 04:16:34,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:16:34" (3/3) ... [2022-04-08 04:16:34,877 INFO L111 eAbstractionObserver]: Analyzing ICFG deep-nested.c [2022-04-08 04:16:34,881 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:16:34,881 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:16:34,917 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:16:34,931 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:16:34,931 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:16:34,949 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:16:34,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-08 04:16:34,954 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:34,955 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:34,956 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:34,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 764687304, now seen corresponding path program 1 times [2022-04-08 04:16:34,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:34,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1984808172] [2022-04-08 04:16:34,978 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:16:34,979 INFO L85 PathProgramCache]: Analyzing trace with hash 764687304, now seen corresponding path program 2 times [2022-04-08 04:16:34,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:16:34,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714787249] [2022-04-08 04:16:34,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:16:34,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:16:35,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:35,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:16:35,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:16:35,267 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(14, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 04:16:35,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:16:35,267 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #79#return; {27#true} is VALID [2022-04-08 04:16:35,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {34#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:16:35,269 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(14, 2);call #Ultimate.allocInit(12, 3); {27#true} is VALID [2022-04-08 04:16:35,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-08 04:16:35,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #79#return; {27#true} is VALID [2022-04-08 04:16:35,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret9 := main(); {27#true} is VALID [2022-04-08 04:16:35,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} havoc ~a~0;havoc ~b~0;havoc ~c~0;havoc ~d~0;havoc ~e~0;havoc ~uint32_max~0;~uint32_max~0 := 4294967295;~a~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-08 04:16:35,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~a~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~b~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-08 04:16:35,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~b~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~c~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-08 04:16:35,272 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~c~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~d~0 := 0; {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} is VALID [2022-04-08 04:16:35,273 INFO L290 TraceCheckUtils]: 9: Hoare triple {32#(and (<= 4294967295 main_~uint32_max~0) (<= main_~uint32_max~0 4294967295))} assume !!(~d~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296);~e~0 := 0; {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} is VALID [2022-04-08 04:16:35,273 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} assume !!(~e~0 % 4294967296 < (~uint32_max~0 - 1) % 4294967296); {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} is VALID [2022-04-08 04:16:35,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(and (<= 4294967295 main_~uint32_max~0) (not (<= (+ 2 (div main_~e~0 4294967296)) (div (+ 4294967294 main_~uint32_max~0) 4294967296))) (= main_~e~0 0))} assume (((~a~0 % 4294967296 == ~b~0 % 4294967296 && ~b~0 % 4294967296 == ~c~0 % 4294967296) && ~c~0 % 4294967296 == ~d~0 % 4294967296) && ~d~0 % 4294967296 == ~e~0 % 4294967296) && ~e~0 % 4294967296 == (~uint32_max~0 - 2) % 4294967296; {28#false} is VALID [2022-04-08 04:16:35,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-08 04:16:35,275 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:16:35,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:16:35,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714787249] [2022-04-08 04:16:35,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714787249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:35,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:35,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:16:35,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:16:35,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1984808172] [2022-04-08 04:16:35,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1984808172] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:16:35,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:16:35,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 04:16:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369464691] [2022-04-08 04:16:35,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:16:35,282 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 04:16:35,283 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:16:35,285 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,299 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 04:16:35,299 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 04:16:35,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:35,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 04:16:35,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 04:16:35,329 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 19 states have internal predecessors, (30), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:35,612 INFO L93 Difference]: Finished difference Result 45 states and 68 transitions. [2022-04-08 04:16:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 04:16:35,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-08 04:16:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:16:35,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 04:16:35,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-08 04:16:35,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-08 04:16:35,718 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:35,726 INFO L225 Difference]: With dead ends: 45 [2022-04-08 04:16:35,726 INFO L226 Difference]: Without dead ends: 22 [2022-04-08 04:16:35,729 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-08 04:16:35,733 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:16:35,735 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 30 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:16:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-04-08 04:16:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2022-04-08 04:16:35,810 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:16:35,811 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,811 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,812 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:35,815 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-08 04:16:35,815 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 04:16:35,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:35,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:35,816 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 04:16:35,816 INFO L87 Difference]: Start difference. First operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 22 states. [2022-04-08 04:16:35,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:16:35,819 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-04-08 04:16:35,820 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2022-04-08 04:16:35,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:16:35,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:16:35,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:16:35,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:16:35,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 17 states have internal predecessors, (22), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-04-08 04:16:35,823 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 13 [2022-04-08 04:16:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:16:35,824 INFO L478 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-04-08 04:16:35,824 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 04:16:35,825 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 25 transitions. [2022-04-08 04:16:35,853 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:16:35,854 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-04-08 04:16:35,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-08 04:16:35,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:16:35,857 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:16:35,858 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:16:35,858 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:16:35,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:16:35,858 INFO L85 PathProgramCache]: Analyzing trace with hash 296825287, now seen corresponding path program 1 times [2022-04-08 04:16:35,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:16:35,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [704126536] [2022-04-08 04:16:39,829 WARN L970 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:16:43,368 WARN L977 rdanLoopAcceleration]: Unable to prove correctness of quantifier elimination. [2022-04-08 04:16:43,763 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 04:16:43,767 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~pre8_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 04:16:43,770 INFO L158 Benchmark]: Toolchain (without parser) took 9394.68ms. Allocated memory was 212.9MB in the beginning and 262.1MB in the end (delta: 49.3MB). Free memory was 165.2MB in the beginning and 191.9MB in the end (delta: -26.7MB). Peak memory consumption was 24.1MB. Max. memory is 8.0GB. [2022-04-08 04:16:43,770 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 212.9MB. Free memory is still 181.5MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:16:43,770 INFO L158 Benchmark]: CACSL2BoogieTranslator took 180.55ms. Allocated memory is still 212.9MB. Free memory was 164.9MB in the beginning and 190.1MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:16:43,771 INFO L158 Benchmark]: Boogie Preprocessor took 34.03ms. Allocated memory is still 212.9MB. Free memory was 190.1MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:16:43,771 INFO L158 Benchmark]: RCFGBuilder took 276.84ms. Allocated memory is still 212.9MB. Free memory was 188.4MB in the beginning and 176.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:16:43,771 INFO L158 Benchmark]: TraceAbstraction took 8898.15ms. Allocated memory was 212.9MB in the beginning and 262.1MB in the end (delta: 49.3MB). Free memory was 176.4MB in the beginning and 191.9MB in the end (delta: -15.5MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. [2022-04-08 04:16:43,773 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 212.9MB. Free memory is still 181.5MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 180.55ms. Allocated memory is still 212.9MB. Free memory was 164.9MB in the beginning and 190.1MB in the end (delta: -25.2MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.03ms. Allocated memory is still 212.9MB. Free memory was 190.1MB in the beginning and 188.4MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 276.84ms. Allocated memory is still 212.9MB. Free memory was 188.4MB in the beginning and 176.9MB in the end (delta: 11.6MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 8898.15ms. Allocated memory was 212.9MB in the beginning and 262.1MB in the end (delta: 49.3MB). Free memory was 176.4MB in the beginning and 191.9MB in the end (delta: -15.5MB). Peak memory consumption was 35.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~pre8_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~pre8_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 04:16:43,785 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...