/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/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loop-new/half.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 12:39:22,652 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 12:39:22,655 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 12:39:22,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 12:39:22,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 12:39:22,702 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 12:39:22,704 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 12:39:22,707 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 12:39:22,709 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 12:39:22,713 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 12:39:22,714 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 12:39:22,716 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 12:39:22,716 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 12:39:22,718 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 12:39:22,719 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 12:39:22,722 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 12:39:22,723 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 12:39:22,723 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 12:39:22,726 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 12:39:22,731 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 12:39:22,734 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 12:39:22,735 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 12:39:22,736 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 12:39:22,736 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 12:39:22,738 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 12:39:22,744 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 12:39:22,744 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 12:39:22,745 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 12:39:22,745 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 12:39:22,746 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 12:39:22,747 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 12:39:22,748 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 12:39:22,749 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 12:39:22,750 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 12:39:22,750 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 12:39:22,751 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 12:39:22,751 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 12:39:22,752 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 12:39:22,752 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 12:39:22,752 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 12:39:22,753 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 12:39:22,754 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 12:39:22,755 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 12:39:22,766 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 12:39:22,767 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 12:39:22,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 12:39:22,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 12:39:22,768 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 12:39:22,768 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 12:39:22,768 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 12:39:22,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 12:39:22,769 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 12:39:22,769 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 12:39:22,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 12:39:22,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 12:39:22,770 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 12:39:22,770 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 12:39:22,770 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 12:39:22,770 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:39:22,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 12:39:22,771 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 12:39:22,771 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 12:39:22,771 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 12:39:22,771 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 12:39:22,771 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 12:39:22,771 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-15 12:39:23,003 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 12:39:23,029 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 12:39:23,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 12:39:23,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 12:39:23,033 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 12:39:23,034 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-new/half.i [2022-04-15 12:39:23,095 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5825650b/1f912e447fc74728a5c0c57e00dbe5b4/FLAG473ef87ea [2022-04-15 12:39:23,486 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 12:39:23,486 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-new/half.i [2022-04-15 12:39:23,493 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5825650b/1f912e447fc74728a5c0c57e00dbe5b4/FLAG473ef87ea [2022-04-15 12:39:23,898 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e5825650b/1f912e447fc74728a5c0c57e00dbe5b4 [2022-04-15 12:39:23,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 12:39:23,902 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 12:39:23,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 12:39:23,904 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 12:39:23,908 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 12:39:23,909 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:23" (1/1) ... [2022-04-15 12:39:23,910 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2fb71c08 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:23, skipping insertion in model container [2022-04-15 12:39:23,910 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 12:39:23" (1/1) ... [2022-04-15 12:39:23,917 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 12:39:23,931 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 12:39:24,080 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-new/half.i[891,904] [2022-04-15 12:39:24,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:39:24,109 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 12:39:24,119 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-new/half.i[891,904] [2022-04-15 12:39:24,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 12:39:24,133 INFO L208 MainTranslator]: Completed translation [2022-04-15 12:39:24,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24 WrapperNode [2022-04-15 12:39:24,134 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 12:39:24,134 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 12:39:24,135 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 12:39:24,135 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 12:39:24,143 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,144 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,149 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,149 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,154 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,161 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 12:39:24,162 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 12:39:24,162 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 12:39:24,162 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 12:39:24,162 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (1/1) ... [2022-04-15 12:39:24,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 12:39:24,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 12:39:24,201 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-15 12:39:24,219 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-15 12:39:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 12:39:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 12:39:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 12:39:24,249 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 12:39:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 12:39:24,250 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 12:39:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 12:39:24,250 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 12:39:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 12:39:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 12:39:24,251 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 12:39:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 12:39:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 12:39:24,252 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 12:39:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 12:39:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 12:39:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 12:39:24,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 12:39:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 12:39:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 12:39:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 12:39:24,254 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 12:39:24,305 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 12:39:24,306 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 12:39:24,440 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 12:39:24,446 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 12:39:24,446 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 12:39:24,448 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:24 BoogieIcfgContainer [2022-04-15 12:39:24,448 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 12:39:24,449 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 12:39:24,450 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 12:39:24,452 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 12:39:24,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 12:39:23" (1/3) ... [2022-04-15 12:39:24,453 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:24, skipping insertion in model container [2022-04-15 12:39:24,453 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 12:39:24" (2/3) ... [2022-04-15 12:39:24,454 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@230419 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 12:39:24, skipping insertion in model container [2022-04-15 12:39:24,454 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 12:39:24" (3/3) ... [2022-04-15 12:39:24,455 INFO L111 eAbstractionObserver]: Analyzing ICFG half.i [2022-04-15 12:39:24,459 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 12:39:24,460 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 12:39:24,522 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 12:39:24,528 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-15 12:39:24,528 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 12:39:24,574 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-15 12:39:24,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:39:24,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:24,595 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:24,595 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:24,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:24,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 1 times [2022-04-15 12:39:24,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:24,607 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900445666] [2022-04-15 12:39:24,618 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:39:24,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1574076283, now seen corresponding path program 2 times [2022-04-15 12:39:24,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:24,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012653306] [2022-04-15 12:39:24,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:24,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:24,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:24,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:24,837 INFO L290 TraceCheckUtils]: 0: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:39:24,837 INFO L290 TraceCheckUtils]: 1: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:39:24,837 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-15 12:39:24,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {25#true} call ULTIMATE.init(); {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:24,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {30#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {25#true} is VALID [2022-04-15 12:39:24,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {25#true} assume true; {25#true} is VALID [2022-04-15 12:39:24,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {25#true} {25#true} #60#return; {25#true} is VALID [2022-04-15 12:39:24,840 INFO L272 TraceCheckUtils]: 4: Hoare triple {25#true} call #t~ret4 := main(); {25#true} is VALID [2022-04-15 12:39:24,841 INFO L290 TraceCheckUtils]: 5: Hoare triple {25#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {25#true} is VALID [2022-04-15 12:39:24,841 INFO L290 TraceCheckUtils]: 6: Hoare triple {25#true} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {25#true} is VALID [2022-04-15 12:39:24,842 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#true} assume !true; {26#false} is VALID [2022-04-15 12:39:24,842 INFO L272 TraceCheckUtils]: 8: Hoare triple {26#false} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {26#false} is VALID [2022-04-15 12:39:24,844 INFO L290 TraceCheckUtils]: 9: Hoare triple {26#false} ~cond := #in~cond; {26#false} is VALID [2022-04-15 12:39:24,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {26#false} assume 0 == ~cond; {26#false} is VALID [2022-04-15 12:39:24,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {26#false} assume !false; {26#false} is VALID [2022-04-15 12:39:24,845 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-15 12:39:24,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:24,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012653306] [2022-04-15 12:39:24,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012653306] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:24,846 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:24,847 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:39:24,850 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:24,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900445666] [2022-04-15 12:39:24,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900445666] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:24,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:24,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 12:39:24,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844267243] [2022-04-15 12:39:24,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:24,856 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 12:39:24,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:24,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 12:39:24,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:24,885 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 12:39:24,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:24,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 12:39:24,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 12:39:24,919 INFO L87 Difference]: Start difference. First operand has 22 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 12:39:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,015 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-04-15 12:39:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 12:39:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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 12 [2022-04-15 12:39:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 12:39:25,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 12:39:25,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 12:39:25,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2022-04-15 12:39:25,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 39 transitions. [2022-04-15 12:39:25,096 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:25,103 INFO L225 Difference]: With dead ends: 34 [2022-04-15 12:39:25,103 INFO L226 Difference]: Without dead ends: 15 [2022-04-15 12:39:25,106 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-15 12:39:25,112 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 15 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:25,114 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 12:39:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-04-15 12:39:25,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-04-15 12:39:25,151 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:25,151 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-15 12:39:25,152 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-15 12:39:25,153 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-15 12:39:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,160 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:39:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:39:25,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:25,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:25,162 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-15 12:39:25,162 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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) Second operand 15 states. [2022-04-15 12:39:25,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,166 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2022-04-15 12:39:25,166 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:39:25,166 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:25,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:25,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:25,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:25,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.2) internal successors, (12), 10 states have internal predecessors, (12), 3 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-15 12:39:25,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-04-15 12:39:25,170 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 12 [2022-04-15 12:39:25,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:25,171 INFO L478 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-04-15 12:39:25,172 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 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-15 12:39:25,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 16 transitions. [2022-04-15 12:39:25,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:25,213 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-04-15 12:39:25,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-15 12:39:25,219 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:25,219 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:25,219 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 12:39:25,220 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:25,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:25,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 1 times [2022-04-15 12:39:25,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:25,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1552759093] [2022-04-15 12:39:25,224 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 12:39:25,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1563917552, now seen corresponding path program 2 times [2022-04-15 12:39:25,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:25,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626073152] [2022-04-15 12:39:25,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:25,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:25,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:25,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:25,447 INFO L290 TraceCheckUtils]: 0: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {161#true} is VALID [2022-04-15 12:39:25,447 INFO L290 TraceCheckUtils]: 1: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 12:39:25,448 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-15 12:39:25,448 INFO L272 TraceCheckUtils]: 0: Hoare triple {161#true} call ULTIMATE.init(); {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:25,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {161#true} is VALID [2022-04-15 12:39:25,449 INFO L290 TraceCheckUtils]: 2: Hoare triple {161#true} assume true; {161#true} is VALID [2022-04-15 12:39:25,449 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {161#true} {161#true} #60#return; {161#true} is VALID [2022-04-15 12:39:25,449 INFO L272 TraceCheckUtils]: 4: Hoare triple {161#true} call #t~ret4 := main(); {161#true} is VALID [2022-04-15 12:39:25,450 INFO L290 TraceCheckUtils]: 5: Hoare triple {161#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-15 12:39:25,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-15 12:39:25,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {167#(and (or (= main_~k~0 0) (= main_~i~0 0)) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} assume !(~i~0 < 2 * ~k~0); {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-15 12:39:25,452 INFO L272 TraceCheckUtils]: 8: Hoare triple {168#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {169#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:39:25,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {169#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {170#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:39:25,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {170#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {162#false} is VALID [2022-04-15 12:39:25,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {162#false} assume !false; {162#false} is VALID [2022-04-15 12:39:25,454 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-15 12:39:25,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:25,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626073152] [2022-04-15 12:39:25,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626073152] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:25,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:25,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:39:25,455 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:25,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1552759093] [2022-04-15 12:39:25,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1552759093] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:25,455 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:25,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:39:25,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124262888] [2022-04-15 12:39:25,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:25,456 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-15 12:39:25,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:25,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-15 12:39:25,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:25,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 12:39:25,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:25,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 12:39:25,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-04-15 12:39:25,470 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-15 12:39:25,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,735 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-15 12:39:25,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 12:39:25,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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 12 [2022-04-15 12:39:25,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:25,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-15 12:39:25,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 12:39:25,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-15 12:39:25,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 31 transitions. [2022-04-15 12:39:25,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 31 transitions. [2022-04-15 12:39:25,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:25,773 INFO L225 Difference]: With dead ends: 27 [2022-04-15 12:39:25,773 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 12:39:25,774 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2022-04-15 12:39:25,775 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 31 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:25,775 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 27 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:25,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 12:39:25,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 18. [2022-04-15 12:39:25,783 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:25,783 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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-15 12:39:25,784 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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-15 12:39:25,784 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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-15 12:39:25,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,785 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 12:39:25,786 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:39:25,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:25,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:25,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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) Second operand 21 states. [2022-04-15 12:39:25,786 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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) Second operand 21 states. [2022-04-15 12:39:25,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:25,788 INFO L93 Difference]: Finished difference Result 21 states and 24 transitions. [2022-04-15 12:39:25,788 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-04-15 12:39:25,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:25,788 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:25,789 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:25,789 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 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-15 12:39:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 12:39:25,790 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-15 12:39:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:25,790 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 12:39:25,790 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 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-15 12:39:25,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 12:39:25,811 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-15 12:39:25,811 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 12:39:25,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 12:39:25,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:25,812 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:25,812 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 12:39:25,812 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:25,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:25,813 INFO L85 PathProgramCache]: Analyzing trace with hash -505067407, now seen corresponding path program 1 times [2022-04-15 12:39:25,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:25,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [436922700] [2022-04-15 12:39:26,062 INFO L271 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-04-15 12:39:26,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1935760618, now seen corresponding path program 1 times [2022-04-15 12:39:26,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 12:39:26,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321099332] [2022-04-15 12:39:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 12:39:26,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 12:39:26,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:26,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 12:39:26,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 12:39:26,234 INFO L290 TraceCheckUtils]: 0: Hoare triple {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {316#true} is VALID [2022-04-15 12:39:26,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 12:39:26,234 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 12:39:26,235 INFO L272 TraceCheckUtils]: 0: Hoare triple {316#true} call ULTIMATE.init(); {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 12:39:26,235 INFO L290 TraceCheckUtils]: 1: Hoare triple {326#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2); {316#true} is VALID [2022-04-15 12:39:26,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {316#true} assume true; {316#true} is VALID [2022-04-15 12:39:26,236 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {316#true} {316#true} #60#return; {316#true} is VALID [2022-04-15 12:39:26,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {316#true} call #t~ret4 := main(); {316#true} is VALID [2022-04-15 12:39:26,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {316#true} ~i~0 := 0;~n~0 := 0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1; {321#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} is VALID [2022-04-15 12:39:26,242 INFO L290 TraceCheckUtils]: 6: Hoare triple {321#(or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0))} assume !!(~k~0 <= 1000000 && ~k~0 >= -1000000);~i~0 := 0; {322#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-15 12:39:26,244 INFO L290 TraceCheckUtils]: 7: Hoare triple {322#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [64] L29-3-->L29-4_primed: Formula: (let ((.cse0 (= v_main_~n~0_In_1 v_main_~n~0_Out_2)) (.cse1 (= v_main_~i~0_In_1 v_main_~i~0_Out_2))) (or (and (= v_main_~n~0_Out_2 0) (= (mod (+ v_main_~i~0_Out_2 1) 2) 0) .cse0 (= |v_main_#t~post3_Out_2| 0) (< v_main_~i~0_Out_2 (+ (* 2 v_main_~k~0_In_1) 1)) .cse1 (= |v_main_#t~post2_Out_2| 0)) (and .cse0 .cse1 (= v_main_~k~0_In_1 v_main_~k~0_In_1)))) InVars {main_~i~0=v_main_~i~0_In_1, main_~n~0=v_main_~n~0_In_1, main_~k~0=v_main_~k~0_In_1} OutVars{main_~i~0=v_main_~i~0_Out_2, main_#t~post2=|v_main_#t~post2_Out_2|, main_#t~post3=|v_main_#t~post3_Out_2|, main_~n~0=v_main_~n~0_Out_2, main_~k~0=v_main_~k~0_In_1} AuxVars[] AssignedVars[main_~i~0, main_#t~post2, main_#t~post3, main_~n~0] {322#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} is VALID [2022-04-15 12:39:26,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {322#(and (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)) (= main_~i~0 0))} [63] L29-4_primed-->L29-4: Formula: (not (< v_main_~i~0_5 (* v_main_~k~0_4 2))) InVars {main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} OutVars{main_~k~0=v_main_~k~0_4, main_~i~0=v_main_~i~0_5} AuxVars[] AssignedVars[] {323#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} is VALID [2022-04-15 12:39:26,246 INFO L272 TraceCheckUtils]: 9: Hoare triple {323#(and (<= main_~k~0 0) (or (not (= main_~k~0 0)) (= main_~n~0 main_~k~0)))} call __VERIFIER_assert((if ~k~0 < 0 || ~n~0 == ~k~0 then 1 else 0)); {324#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 12:39:26,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {324#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {325#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 12:39:26,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {317#false} is VALID [2022-04-15 12:39:26,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {317#false} assume !false; {317#false} is VALID [2022-04-15 12:39:26,248 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-15 12:39:26,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 12:39:26,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321099332] [2022-04-15 12:39:26,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321099332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:26,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:26,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 12:39:26,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 12:39:26,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [436922700] [2022-04-15 12:39:26,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [436922700] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 12:39:26,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 12:39:26,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 12:39:26,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517779419] [2022-04-15 12:39:26,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 12:39:26,367 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 12:39:26,367 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 12:39:26,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 12:39:26,380 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:26,381 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 12:39:26,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:26,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 12:39:26,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-15 12:39:26,382 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 12:39:26,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:26,684 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-04-15 12:39:26,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 12:39:26,684 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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 15 [2022-04-15 12:39:26,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 12:39:26,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 12:39:26,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 12:39:26,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 12:39:26,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 40 transitions. [2022-04-15 12:39:26,689 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 40 transitions. [2022-04-15 12:39:26,725 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:26,726 INFO L225 Difference]: With dead ends: 36 [2022-04-15 12:39:26,726 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 12:39:26,727 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-04-15 12:39:26,728 INFO L913 BasicCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 12:39:26,728 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 42 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 12:39:26,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 12:39:26,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2022-04-15 12:39:26,738 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 12:39:26,738 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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-15 12:39:26,739 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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-15 12:39:26,739 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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-15 12:39:26,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:26,741 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 12:39:26,741 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:39:26,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:26,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:26,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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) Second operand 25 states. [2022-04-15 12:39:26,742 INFO L87 Difference]: Start difference. First operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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) Second operand 25 states. [2022-04-15 12:39:26,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 12:39:26,743 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-15 12:39:26,764 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-15 12:39:26,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 12:39:26,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 12:39:26,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 12:39:26,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 12:39:26,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 3 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-15 12:39:26,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-04-15 12:39:26,766 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 15 [2022-04-15 12:39:26,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 12:39:26,766 INFO L478 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-04-15 12:39:26,766 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.2222222222222223) internal successors, (11), 8 states have internal predecessors, (11), 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-15 12:39:26,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 21 transitions. [2022-04-15 12:39:26,787 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 12:39:26,788 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-04-15 12:39:26,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 12:39:26,788 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 12:39:26,788 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 12:39:26,788 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-15 12:39:26,789 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 12:39:26,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 12:39:26,789 INFO L85 PathProgramCache]: Analyzing trace with hash 1214691282, now seen corresponding path program 1 times [2022-04-15 12:39:26,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 12:39:26,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1851770286] [2022-04-15 12:39:27,577 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.pushout(QvasrAbstractionJoin.java:181) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.join(QvasrAbstractionJoin.java:116) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrSummarizer.summarizeLoop(QvasrSummarizer.java:130) at de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrLoopSummarization.getQvasrAcceleration(QvasrLoopSummarization.java:87) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.loopaccelerator.AcceleratorQvasr.accelerateLoop(AcceleratorQvasr.java:91) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolationCore.acceleratedInterpolationCoreIsCorrect(AcceleratedInterpolationCore.java:246) at de.uni_freiburg.informatik.ultimate.lib.acceleratedinterpolation.AcceleratedInterpolation.(AcceleratedInterpolation.java:195) 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:411) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:301) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:261) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:153) 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-15 12:39:27,580 INFO L158 Benchmark]: Toolchain (without parser) took 3678.71ms. Allocated memory is still 172.0MB. Free memory was 123.7MB in the beginning and 114.2MB in the end (delta: 9.5MB). Peak memory consumption was 9.5MB. Max. memory is 8.0GB. [2022-04-15 12:39:27,581 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 172.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 90.0kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 12:39:27,581 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.50ms. Allocated memory is still 172.0MB. Free memory was 123.4MB in the beginning and 149.8MB in the end (delta: -26.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. [2022-04-15 12:39:27,581 INFO L158 Benchmark]: Boogie Preprocessor took 26.47ms. Allocated memory is still 172.0MB. Free memory was 149.8MB in the beginning and 148.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 12:39:27,582 INFO L158 Benchmark]: RCFGBuilder took 286.50ms. Allocated memory is still 172.0MB. Free memory was 148.1MB in the beginning and 136.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-15 12:39:27,582 INFO L158 Benchmark]: TraceAbstraction took 3130.05ms. Allocated memory is still 172.0MB. Free memory was 136.3MB in the beginning and 114.2MB in the end (delta: 22.2MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. [2022-04-15 12:39:27,583 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.17ms. Allocated memory is still 172.0MB. Free memory was 140.0MB in the beginning and 139.9MB in the end (delta: 90.0kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 230.50ms. Allocated memory is still 172.0MB. Free memory was 123.4MB in the beginning and 149.8MB in the end (delta: -26.4MB). Peak memory consumption was 11.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 26.47ms. Allocated memory is still 172.0MB. Free memory was 149.8MB in the beginning and 148.1MB in the end (delta: 1.7MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 286.50ms. Allocated memory is still 172.0MB. Free memory was 148.1MB in the beginning and 136.8MB in the end (delta: 11.3MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 3130.05ms. Allocated memory is still 172.0MB. Free memory was 136.3MB in the beginning and 114.2MB in the end (delta: 22.2MB). Peak memory consumption was 22.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0 de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArrayIndexOutOfBoundsException: Index 0 out of bounds for length 0: de.uni_freiburg.informatik.ultimate.icfgtransformer.loopacceleration.qvasr.QvasrAbstractionJoin.removeLastColumnRational(QvasrAbstractionJoin.java:431) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-04-15 12:39:27,621 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...