/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loops-crafted-1/vnew1.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 04:15:55,423 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 04:15:55,425 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 04:15:55,444 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 04:15:55,444 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 04:15:55,445 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 04:15:55,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 04:15:55,447 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 04:15:55,448 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 04:15:55,449 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 04:15:55,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 04:15:55,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 04:15:55,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 04:15:55,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 04:15:55,456 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 04:15:55,457 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 04:15:55,458 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 04:15:55,461 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 04:15:55,466 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 04:15:55,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 04:15:55,470 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 04:15:55,472 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 04:15:55,473 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 04:15:55,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 04:15:55,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 04:15:55,475 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 04:15:55,475 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 04:15:55,475 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 04:15:55,476 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 04:15:55,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 04:15:55,476 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 04:15:55,476 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 04:15:55,477 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 04:15:55,477 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 04:15:55,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 04:15:55,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 04:15:55,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 04:15:55,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 04:15:55,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 04:15:55,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 04:15:55,479 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 04:15:55,485 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 04:15:55,485 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:15:55,492 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 04:15:55,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 04:15:55,493 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 04:15:55,493 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 04:15:55,493 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 04:15:55,493 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 04:15:55,494 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 04:15:55,495 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:55,495 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 04:15:55,495 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 04:15:55,496 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:15:55,662 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 04:15:55,677 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 04:15:55,678 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 04:15:55,679 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 04:15:55,681 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 04:15:55,682 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-08 04:15:55,734 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fefbd8d/5ff2f5e35301484b9bb35826967d2ce2/FLAG766c10c6c [2022-04-08 04:15:56,061 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 04:15:56,062 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c [2022-04-08 04:15:56,065 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fefbd8d/5ff2f5e35301484b9bb35826967d2ce2/FLAG766c10c6c [2022-04-08 04:15:56,510 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/70fefbd8d/5ff2f5e35301484b9bb35826967d2ce2 [2022-04-08 04:15:56,512 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 04:15:56,514 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 04:15:56,515 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:56,515 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 04:15:56,518 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 04:15:56,518 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,519 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b43d322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56, skipping insertion in model container [2022-04-08 04:15:56,519 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 04:15:56,533 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 04:15:56,640 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c[403,416] [2022-04-08 04:15:56,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:56,679 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 04:15:56,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops-crafted-1/vnew1.c[403,416] [2022-04-08 04:15:56,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 04:15:56,699 INFO L208 MainTranslator]: Completed translation [2022-04-08 04:15:56,699 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56 WrapperNode [2022-04-08 04:15:56,700 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 04:15:56,700 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 04:15:56,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 04:15:56,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 04:15:56,707 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,707 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,712 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,713 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,727 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,734 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 04:15:56,735 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 04:15:56,735 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 04:15:56,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 04:15:56,737 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (1/1) ... [2022-04-08 04:15:56,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 04:15:56,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 04:15:56,760 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:15:56,765 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:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 04:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 04:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 04:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 04:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 04:15:56,790 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 04:15:56,790 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 04:15:56,790 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 04:15:56,790 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 04:15:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 04:15:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 04:15:56,791 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 04:15:56,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 04:15:56,837 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 04:15:56,838 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 04:15:56,995 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 04:15:57,002 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 04:15:57,002 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 04:15:57,003 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:57 BoogieIcfgContainer [2022-04-08 04:15:57,003 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 04:15:57,004 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 04:15:57,004 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 04:15:57,007 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 04:15:57,007 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 04:15:56" (1/3) ... [2022-04-08 04:15:57,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:57, skipping insertion in model container [2022-04-08 04:15:57,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 04:15:56" (2/3) ... [2022-04-08 04:15:57,008 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3996b85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 04:15:57, skipping insertion in model container [2022-04-08 04:15:57,008 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 04:15:57" (3/3) ... [2022-04-08 04:15:57,009 INFO L111 eAbstractionObserver]: Analyzing ICFG vnew1.c [2022-04-08 04:15:57,011 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 04:15:57,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 04:15:57,043 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 04:15:57,047 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:15:57,047 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 04:15:57,058 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 04:15:57,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 04:15:57,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:57,062 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:57,063 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:57,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:57,066 INFO L85 PathProgramCache]: Analyzing trace with hash 486508050, now seen corresponding path program 1 times [2022-04-08 04:15:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:57,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1868717342] [2022-04-08 04:15:57,077 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 04:15:57,078 INFO L85 PathProgramCache]: Analyzing trace with hash 486508050, now seen corresponding path program 2 times [2022-04-08 04:15:57,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 04:15:57,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [347157271] [2022-04-08 04:15:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 04:15:57,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 04:15:57,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:57,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 04:15:57,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 04:15:57,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-08 04:15:57,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 04:15:57,397 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #63#return; {26#true} is VALID [2022-04-08 04:15:57,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 04:15:57,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#(and (= |old(~SIZE~0)| ~SIZE~0) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~SIZE~0 := 20000001; {26#true} is VALID [2022-04-08 04:15:57,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 04:15:57,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #63#return; {26#true} is VALID [2022-04-08 04:15:57,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret8 := main(); {26#true} is VALID [2022-04-08 04:15:57,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~n~0;havoc ~i~0;havoc ~k~0;~n~0 := #t~nondet4;havoc #t~nondet4; {26#true} is VALID [2022-04-08 04:15:57,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !!(~n~0 % 4294967296 <= ~SIZE~0 % 4294967296);~k~0 := ~n~0;~i~0 := 0; {31#(= main_~i~0 0)} is VALID [2022-04-08 04:15:57,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {31#(= main_~i~0 0)} assume !(~i~0 % 4294967296 < ~n~0 % 4294967296); {32#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} is VALID [2022-04-08 04:15:57,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {32#(<= main_~n~0 (* (div main_~n~0 4294967296) 4294967296))} ~j~0 := 0; {33#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} is VALID [2022-04-08 04:15:57,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(and (<= (+ (* (div main_~j~0 4294967296) 12884901888) main_~n~0) (+ (* (div main_~n~0 4294967296) 4294967296) (* (div (div (+ main_~n~0 (* (div main_~n~0 4294967296) (- 4294967296))) 3) 4294967296) 12884901888))) (= main_~j~0 0))} assume !!(~j~0 % 4294967296 < (if ~n~0 % 4294967296 < 0 && 0 != ~n~0 % 4294967296 % 3 then 1 + ~n~0 % 4294967296 / 3 else ~n~0 % 4294967296 / 3) % 4294967296); {27#false} is VALID [2022-04-08 04:15:57,406 INFO L272 TraceCheckUtils]: 10: Hoare triple {27#false} call __VERIFIER_assert((if ~k~0 % 4294967296 > 0 then 1 else 0)); {27#false} is VALID [2022-04-08 04:15:57,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 04:15:57,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 04:15:57,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 04:15:57,407 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:15:57,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 04:15:57,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [347157271] [2022-04-08 04:15:57,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [347157271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:57,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:57,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:15:57,411 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 04:15:57,411 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1868717342] [2022-04-08 04:15:57,411 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1868717342] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 04:15:57,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 04:15:57,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 04:15:57,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914826649] [2022-04-08 04:15:57,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 04:15:57,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 04:15:57,416 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 04:15:57,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 04:15:57,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:57,438 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 04:15:57,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:57,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 04:15:57,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 04:15:57,458 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 04:15:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:57,745 INFO L93 Difference]: Finished difference Result 44 states and 56 transitions. [2022-04-08 04:15:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 04:15:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 14 [2022-04-08 04:15:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 04:15:57,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 04:15:57,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 04:15:57,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 04:15:57,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 56 transitions. [2022-04-08 04:15:57,764 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 56 transitions. [2022-04-08 04:15:57,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:57,827 INFO L225 Difference]: With dead ends: 44 [2022-04-08 04:15:57,827 INFO L226 Difference]: Without dead ends: 19 [2022-04-08 04:15:57,829 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-04-08 04:15:57,831 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 29 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 04:15:57,831 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 42 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 04:15:57,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-08 04:15:57,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-04-08 04:15:57,849 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 04:15:57,849 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:15:57,850 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:15:57,850 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:15:57,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:57,852 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-08 04:15:57,852 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 04:15:57,852 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:57,852 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:57,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 04:15:57,853 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-08 04:15:57,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 04:15:57,854 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2022-04-08 04:15:57,854 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 04:15:57,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 04:15:57,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 04:15:57,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 04:15:57,855 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 04:15:57,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 13 states have internal predecessors, (15), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 04:15:57,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-08 04:15:57,857 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-08 04:15:57,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 04:15:57,857 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-08 04:15:57,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 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 04:15:57,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-08 04:15:57,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 04:15:57,874 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-08 04:15:57,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-08 04:15:57,875 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 04:15:57,875 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 04:15:57,875 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 04:15:57,875 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 04:15:57,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 04:15:57,876 INFO L85 PathProgramCache]: Analyzing trace with hash 77944193, now seen corresponding path program 1 times [2022-04-08 04:15:57,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 04:15:57,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1921461865] [2022-04-08 04:15:58,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 04:15:58,214 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~post5_4|] 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:15:58,234 INFO L158 Benchmark]: Toolchain (without parser) took 1717.19ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 122.0MB in the beginning and 152.2MB in the end (delta: -30.2MB). Peak memory consumption was 6.4MB. Max. memory is 8.0GB. [2022-04-08 04:15:58,234 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 173.0MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 04:15:58,236 INFO L158 Benchmark]: CACSL2BoogieTranslator took 184.50ms. Allocated memory is still 173.0MB. Free memory was 121.8MB in the beginning and 148.9MB in the end (delta: -27.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. [2022-04-08 04:15:58,236 INFO L158 Benchmark]: Boogie Preprocessor took 34.53ms. Allocated memory is still 173.0MB. Free memory was 148.9MB in the beginning and 147.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-08 04:15:58,236 INFO L158 Benchmark]: RCFGBuilder took 268.27ms. Allocated memory is still 173.0MB. Free memory was 147.4MB in the beginning and 135.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 04:15:58,238 INFO L158 Benchmark]: TraceAbstraction took 1219.71ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 135.6MB in the beginning and 152.2MB in the end (delta: -16.6MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. [2022-04-08 04:15:58,242 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.09ms. Allocated memory is still 173.0MB. Free memory was 138.8MB in the beginning and 138.7MB in the end (delta: 73.5kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 184.50ms. Allocated memory is still 173.0MB. Free memory was 121.8MB in the beginning and 148.9MB in the end (delta: -27.1MB). Peak memory consumption was 13.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 34.53ms. Allocated memory is still 173.0MB. Free memory was 148.9MB in the beginning and 147.4MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 268.27ms. Allocated memory is still 173.0MB. Free memory was 147.4MB in the beginning and 135.9MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 1219.71ms. Allocated memory was 173.0MB in the beginning and 207.6MB in the end (delta: 34.6MB). Free memory was 135.6MB in the beginning and 152.2MB in the end (delta: -16.6MB). Peak memory consumption was 19.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~post5_4|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~post5_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:15:58,255 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...