/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-acceleration/functions_1-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 03:47:49,748 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 03:47:49,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 03:47:49,782 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 03:47:49,783 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 03:47:49,784 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 03:47:49,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 03:47:49,787 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 03:47:49,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 03:47:49,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 03:47:49,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 03:47:49,792 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 03:47:49,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 03:47:49,793 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 03:47:49,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 03:47:49,794 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 03:47:49,795 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 03:47:49,795 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 03:47:49,796 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 03:47:49,797 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 03:47:49,798 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 03:47:49,798 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 03:47:49,799 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 03:47:49,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 03:47:49,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 03:47:49,803 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 03:47:49,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 03:47:49,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 03:47:49,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 03:47:49,804 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 03:47:49,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 03:47:49,805 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 03:47:49,805 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 03:47:49,806 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 03:47:49,806 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 03:47:49,807 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 03:47:49,807 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 03:47:49,807 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 03:47:49,807 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 03:47:49,808 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 03:47:49,808 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 03:47:49,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 03:47:49,812 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-08 03:47:49,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 03:47:49,819 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 03:47:49,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 03:47:49,820 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 03:47:49,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 03:47:49,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:49,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-08 03:47:49,822 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 03:47:49,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 03:47:50,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 03:47:50,017 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 03:47:50,017 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 03:47:50,023 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 03:47:50,024 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-08 03:47:50,079 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe1dd2ce/a04b4c6cdf0245be8c7dba8f98612b9e/FLAG600eae8e1 [2022-04-08 03:47:50,438 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 03:47:50,439 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/functions_1-2.c [2022-04-08 03:47:50,442 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe1dd2ce/a04b4c6cdf0245be8c7dba8f98612b9e/FLAG600eae8e1 [2022-04-08 03:47:50,453 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cbe1dd2ce/a04b4c6cdf0245be8c7dba8f98612b9e [2022-04-08 03:47:50,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 03:47:50,456 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 03:47:50,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:50,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 03:47:50,459 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 03:47:50,460 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,461 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7331554a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50, skipping insertion in model container [2022-04-08 03:47:50,461 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,465 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 03:47:50,472 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 03:47:50,603 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-acceleration/functions_1-2.c[325,338] [2022-04-08 03:47:50,611 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:50,617 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 03:47:50,625 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-acceleration/functions_1-2.c[325,338] [2022-04-08 03:47:50,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 03:47:50,635 INFO L208 MainTranslator]: Completed translation [2022-04-08 03:47:50,636 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50 WrapperNode [2022-04-08 03:47:50,636 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 03:47:50,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 03:47:50,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 03:47:50,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 03:47:50,644 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,651 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,653 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,653 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,660 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 03:47:50,660 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 03:47:50,660 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 03:47:50,660 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 03:47:50,661 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (1/1) ... [2022-04-08 03:47:50,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 03:47:50,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 03:47:50,682 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 03:47:50,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 03:47:50,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 03:47:50,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 03:47:50,708 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 03:47:50,708 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 03:47:50,708 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2022-04-08 03:47:50,708 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 03:47:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 03:47:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 03:47:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 03:47:50,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 03:47:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 03:47:50,710 INFO L130 BoogieDeclarations]: Found specification of procedure f [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 03:47:50,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 03:47:50,754 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 03:47:50,756 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 03:47:50,849 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 03:47:50,854 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 03:47:50,855 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 03:47:50,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:50 BoogieIcfgContainer [2022-04-08 03:47:50,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 03:47:50,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 03:47:50,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 03:47:50,868 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 03:47:50,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 03:47:50" (1/3) ... [2022-04-08 03:47:50,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b5c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:50, skipping insertion in model container [2022-04-08 03:47:50,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 03:47:50" (2/3) ... [2022-04-08 03:47:50,869 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e6b5c9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 03:47:50, skipping insertion in model container [2022-04-08 03:47:50,869 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 03:47:50" (3/3) ... [2022-04-08 03:47:50,870 INFO L111 eAbstractionObserver]: Analyzing ICFG functions_1-2.c [2022-04-08 03:47:50,873 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 03:47:50,874 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 03:47:50,942 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 03:47:50,947 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 03:47:50,947 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 03:47:50,971 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 03:47:50,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:50,976 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:50,976 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:50,977 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:50,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:50,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 1 times [2022-04-08 03:47:50,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:50,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [871270532] [2022-04-08 03:47:51,001 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:51,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1649640916, now seen corresponding path program 2 times [2022-04-08 03:47:51,003 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:51,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196325667] [2022-04-08 03:47:51,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:51,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:51,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:51,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:51,155 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 03:47:51,155 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:47:51,155 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-08 03:47:51,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:51,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(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(16, 2);call #Ultimate.allocInit(12, 3); {26#true} is VALID [2022-04-08 03:47:51,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-08 03:47:51,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #42#return; {26#true} is VALID [2022-04-08 03:47:51,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret5 := main(); {26#true} is VALID [2022-04-08 03:47:51,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} ~x~0 := 0; {26#true} is VALID [2022-04-08 03:47:51,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-08 03:47:51,160 INFO L272 TraceCheckUtils]: 7: Hoare triple {27#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {27#false} is VALID [2022-04-08 03:47:51,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-08 03:47:51,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-08 03:47:51,161 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-08 03:47:51,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:51,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:51,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196325667] [2022-04-08 03:47:51,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196325667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:51,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:51,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:51,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:51,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [871270532] [2022-04-08 03:47:51,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [871270532] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:51,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:51,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 03:47:51,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031051203] [2022-04-08 03:47:51,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:51,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:51,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:51,177 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,204 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 03:47:51,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:51,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 03:47:51,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:51,228 INFO L87 Difference]: Start difference. First operand has 23 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,308 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-08 03:47:51,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 03:47:51,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:51,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:51,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 03:47:51,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-08 03:47:51,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-08 03:47:51,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,367 INFO L225 Difference]: With dead ends: 34 [2022-04-08 03:47:51,367 INFO L226 Difference]: Without dead ends: 17 [2022-04-08 03:47:51,370 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 03:47:51,374 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:51,376 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 24 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:51,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-08 03:47:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-08 03:47:51,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:51,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,400 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,400 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,402 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 03:47:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:47:51,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:51,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:51,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 03:47:51,403 INFO L87 Difference]: Start difference. First operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 17 states. [2022-04-08 03:47:51,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,404 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2022-04-08 03:47:51,404 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:47:51,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:51,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:51,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:51,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:51,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2022-04-08 03:47:51,407 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 11 [2022-04-08 03:47:51,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:51,408 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2022-04-08 03:47:51,408 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 17 transitions. [2022-04-08 03:47:51,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,441 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2022-04-08 03:47:51,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-08 03:47:51,441 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:51,441 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:51,441 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 03:47:51,442 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:51,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:51,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 1 times [2022-04-08 03:47:51,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:51,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1793728307] [2022-04-08 03:47:51,443 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 03:47:51,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1655182042, now seen corresponding path program 2 times [2022-04-08 03:47:51,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 03:47:51,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508427420] [2022-04-08 03:47:51,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 03:47:51,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 03:47:51,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:51,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 03:47:51,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 03:47:51,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {176#(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(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-08 03:47:51,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 03:47:51,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-08 03:47:51,576 INFO L272 TraceCheckUtils]: 0: Hoare triple {170#true} call ULTIMATE.init(); {176#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 03:47:51,576 INFO L290 TraceCheckUtils]: 1: Hoare triple {176#(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(16, 2);call #Ultimate.allocInit(12, 3); {170#true} is VALID [2022-04-08 03:47:51,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume true; {170#true} is VALID [2022-04-08 03:47:51,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {170#true} {170#true} #42#return; {170#true} is VALID [2022-04-08 03:47:51,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {170#true} call #t~ret5 := main(); {170#true} is VALID [2022-04-08 03:47:51,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {170#true} ~x~0 := 0; {175#(= main_~x~0 0)} is VALID [2022-04-08 03:47:51,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {175#(= main_~x~0 0)} assume !(~x~0 % 4294967296 < 268435455); {171#false} is VALID [2022-04-08 03:47:51,577 INFO L272 TraceCheckUtils]: 7: Hoare triple {171#false} call __VERIFIER_assert((if (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 <= 2147483647 then (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 else (if ~x~0 % 4294967296 < 0 && 0 != ~x~0 % 4294967296 % 2 then ~x~0 % 4294967296 % 2 - 2 else ~x~0 % 4294967296 % 2) % 4294967296 % 4294967296 - 4294967296)); {171#false} is VALID [2022-04-08 03:47:51,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#false} ~cond := #in~cond; {171#false} is VALID [2022-04-08 03:47:51,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {171#false} assume 0 == ~cond; {171#false} is VALID [2022-04-08 03:47:51,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {171#false} assume !false; {171#false} is VALID [2022-04-08 03:47:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 03:47:51,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 03:47:51,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508427420] [2022-04-08 03:47:51,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508427420] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:51,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:51,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:51,579 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 03:47:51,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1793728307] [2022-04-08 03:47:51,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1793728307] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 03:47:51,579 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 03:47:51,579 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 03:47:51,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725907192] [2022-04-08 03:47:51,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 03:47:51,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:51,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 03:47:51,580 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,594 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,594 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 03:47:51,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:51,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 03:47:51,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 03:47:51,595 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,677 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-08 03:47:51,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 03:47:51,677 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 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 11 [2022-04-08 03:47:51,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 03:47:51,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 03:47:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 26 transitions. [2022-04-08 03:47:51,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 26 transitions. [2022-04-08 03:47:51,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,714 INFO L225 Difference]: With dead ends: 25 [2022-04-08 03:47:51,715 INFO L226 Difference]: Without dead ends: 20 [2022-04-08 03:47:51,715 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-08 03:47:51,718 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 12 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 03:47:51,719 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 22 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 03:47:51,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-04-08 03:47:51,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-04-08 03:47:51,726 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 03:47:51,727 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,727 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,728 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,729 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 03:47:51,729 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 03:47:51,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:51,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:51,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-08 03:47:51,730 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 20 states. [2022-04-08 03:47:51,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 03:47:51,731 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2022-04-08 03:47:51,731 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-08 03:47:51,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 03:47:51,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 03:47:51,732 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 03:47:51,732 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 03:47:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 03:47:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-04-08 03:47:51,733 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2022-04-08 03:47:51,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 03:47:51,733 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-04-08 03:47:51,733 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 3 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 03:47:51,733 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 18 transitions. [2022-04-08 03:47:51,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 03:47:51,749 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-04-08 03:47:51,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 03:47:51,750 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 03:47:51,750 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 03:47:51,750 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 03:47:51,752 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 03:47:51,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 03:47:51,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1503524740, now seen corresponding path program 1 times [2022-04-08 03:47:51,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 03:47:51,756 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1626394648] [2022-04-08 03:47:52,194 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 1 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-08 03:47:52,197 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: free variables [|v_main_#t~ret4_8|] at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:324) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.PredicateHelper.normalizeTerm(PredicateHelper.java:201) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:254) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:190) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleAcceleratedInterpolation.construct(IpTcStrategyModuleAcceleratedInterpolation.java:80) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:57) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:209) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:121) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:595) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:349) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:331) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:412) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-04-08 03:47:52,205 INFO L158 Benchmark]: Toolchain (without parser) took 1748.66ms. Allocated memory is still 188.7MB. Free memory was 139.1MB in the beginning and 79.1MB in the end (delta: 59.9MB). Peak memory consumption was 59.9MB. Max. memory is 8.0GB. [2022-04-08 03:47:52,205 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 188.7MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 03:47:52,205 INFO L158 Benchmark]: CACSL2BoogieTranslator took 179.22ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 167.2MB in the end (delta: -28.4MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-08 03:47:52,206 INFO L158 Benchmark]: Boogie Preprocessor took 23.19ms. Allocated memory is still 188.7MB. Free memory was 167.2MB in the beginning and 166.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 03:47:52,206 INFO L158 Benchmark]: RCFGBuilder took 195.85ms. Allocated memory is still 188.7MB. Free memory was 165.7MB in the beginning and 155.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-04-08 03:47:52,206 INFO L158 Benchmark]: TraceAbstraction took 1346.59ms. Allocated memory is still 188.7MB. Free memory was 155.2MB in the beginning and 79.1MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. [2022-04-08 03:47:52,207 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 188.7MB. Free memory is still 155.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 179.22ms. Allocated memory is still 188.7MB. Free memory was 138.9MB in the beginning and 167.2MB in the end (delta: -28.4MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. * Boogie Preprocessor took 23.19ms. Allocated memory is still 188.7MB. Free memory was 167.2MB in the beginning and 166.2MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 195.85ms. Allocated memory is still 188.7MB. Free memory was 165.7MB in the beginning and 155.7MB in the end (delta: 10.0MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * TraceAbstraction took 1346.59ms. Allocated memory is still 188.7MB. Free memory was 155.2MB in the beginning and 79.1MB in the end (delta: 76.0MB). Peak memory consumption was 75.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: free variables [|v_main_#t~ret4_8|] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: free variables [|v_main_#t~ret4_8|]: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.(UnmodifiableTransFormula.java:97) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-08 03:47:52,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...