/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-invgen/half_2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 20:58:03,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 20:58:03,423 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 20:58:03,470 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 20:58:03,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 20:58:03,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 20:58:03,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 20:58:03,473 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 20:58:03,474 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 20:58:03,474 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 20:58:03,475 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 20:58:03,476 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 20:58:03,476 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 20:58:03,476 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 20:58:03,477 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 20:58:03,478 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 20:58:03,478 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 20:58:03,479 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 20:58:03,480 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 20:58:03,481 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 20:58:03,482 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 20:58:03,484 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 20:58:03,485 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 20:58:03,486 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 20:58:03,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 20:58:03,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 20:58:03,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 20:58:03,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 20:58:03,488 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 20:58:03,489 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 20:58:03,489 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 20:58:03,489 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 20:58:03,490 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 20:58:03,490 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 20:58:03,491 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 20:58:03,491 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 20:58:03,491 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 20:58:03,492 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 20:58:03,492 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 20:58:03,492 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 20:58:03,493 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 20:58:03,498 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-01-31 20:58:03,508 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 20:58:03,508 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 20:58:03,509 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 20:58:03,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 20:58:03,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 20:58:03,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 20:58:03,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 20:58:03,509 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 20:58:03,510 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 20:58:03,511 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:03,511 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 20:58:03,511 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 20:58:03,511 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-01-31 20:58:03,675 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 20:58:03,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 20:58:03,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 20:58:03,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 20:58:03,697 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 20:58:03,698 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-invgen/half_2.i [2022-01-31 20:58:03,757 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3562d23b7/31d194ccea494e4e8e9690fdec3fddcf/FLAG4f2a7a541 [2022-01-31 20:58:04,052 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 20:58:04,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i [2022-01-31 20:58:04,060 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3562d23b7/31d194ccea494e4e8e9690fdec3fddcf/FLAG4f2a7a541 [2022-01-31 20:58:04,491 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3562d23b7/31d194ccea494e4e8e9690fdec3fddcf [2022-01-31 20:58:04,493 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 20:58:04,494 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 20:58:04,495 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:04,495 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 20:58:04,497 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 20:58:04,498 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,498 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c6c792a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04, skipping insertion in model container [2022-01-31 20:58:04,498 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,502 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 20:58:04,512 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 20:58:04,642 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i[893,906] [2022-01-31 20:58:04,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:04,653 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 20:58:04,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-invgen/half_2.i[893,906] [2022-01-31 20:58:04,666 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 20:58:04,675 INFO L208 MainTranslator]: Completed translation [2022-01-31 20:58:04,676 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04 WrapperNode [2022-01-31 20:58:04,676 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 20:58:04,676 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 20:58:04,677 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 20:58:04,677 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 20:58:04,684 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,684 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,697 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,704 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,706 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 20:58:04,707 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 20:58:04,707 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 20:58:04,707 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 20:58:04,708 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (1/1) ... [2022-01-31 20:58:04,713 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 20:58:04,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 20:58:04,729 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-01-31 20:58:04,760 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-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 20:58:04,780 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 20:58:04,780 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-01-31 20:58:04,781 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 20:58:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 20:58:04,782 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 20:58:04,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 20:58:04,826 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 20:58:04,827 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 20:58:04,902 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 20:58:04,921 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 20:58:04,922 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-01-31 20:58:04,923 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:04 BoogieIcfgContainer [2022-01-31 20:58:04,923 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 20:58:04,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 20:58:04,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 20:58:04,934 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 20:58:04,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:58:04" (1/3) ... [2022-01-31 20:58:04,934 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:04, skipping insertion in model container [2022-01-31 20:58:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:58:04" (2/3) ... [2022-01-31 20:58:04,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1263236d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:58:04, skipping insertion in model container [2022-01-31 20:58:04,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:58:04" (3/3) ... [2022-01-31 20:58:04,936 INFO L111 eAbstractionObserver]: Analyzing ICFG half_2.i [2022-01-31 20:58:04,939 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 20:58:04,939 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 20:58:04,981 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 20:58:04,985 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, 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, mLoopAccelerationTechnique=JORDAN [2022-01-31 20:58:04,985 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 20:58:04,997 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:05,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 20:58:05,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:05,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:05,002 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:05,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:05,005 INFO L85 PathProgramCache]: Analyzing trace with hash 21938802, now seen corresponding path program 1 times [2022-01-31 20:58:05,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:05,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [242668997] [2022-01-31 20:58:05,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:05,026 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:05,058 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 20:58:05,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:05,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:05,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:05,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:05,250 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:05,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [242668997] [2022-01-31 20:58:05,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [242668997] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:05,252 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:05,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-31 20:58:05,253 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937915938] [2022-01-31 20:58:05,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:05,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-31 20:58:05,256 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:05,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-31 20:58:05,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-01-31 20:58:05,276 INFO L87 Difference]: Start difference. First operand has 23 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 16 states have internal predecessors, (22), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:05,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:05,435 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-01-31 20:58:05,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-31 20:58:05,452 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-01-31 20:58:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:05,458 INFO L225 Difference]: With dead ends: 50 [2022-01-31 20:58:05,458 INFO L226 Difference]: Without dead ends: 27 [2022-01-31 20:58:05,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2022-01-31 20:58:05,462 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 35 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:05,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 52 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:05,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-31 20:58:05,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-01-31 20:58:05,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:05,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-31 20:58:05,517 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 14 [2022-01-31 20:58:05,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:05,517 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-31 20:58:05,517 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 6 states have internal predecessors, (10), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-31 20:58:05,517 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-31 20:58:05,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-31 20:58:05,518 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:05,518 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:05,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 20:58:05,518 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:05,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:05,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1438800602, now seen corresponding path program 1 times [2022-01-31 20:58:05,519 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:05,519 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [660501072] [2022-01-31 20:58:05,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:05,625 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:05,626 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:05,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:05,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:05,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:05,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:05,835 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:05,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [660501072] [2022-01-31 20:58:05,836 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [660501072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:05,836 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:05,836 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-01-31 20:58:05,837 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689770570] [2022-01-31 20:58:05,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:05,837 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-01-31 20:58:05,837 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:05,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-01-31 20:58:05,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-31 20:58:05,838 INFO L87 Difference]: Start difference. First operand 26 states and 28 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-01-31 20:58:05,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:05,985 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-01-31 20:58:05,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-31 20:58:05,985 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-01-31 20:58:05,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:05,988 INFO L225 Difference]: With dead ends: 35 [2022-01-31 20:58:05,988 INFO L226 Difference]: Without dead ends: 33 [2022-01-31 20:58:05,988 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2022-01-31 20:58:05,990 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 15 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:05,990 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 67 Invalid, 129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 82 Invalid, 0 Unknown, 39 Unchecked, 0.1s Time] [2022-01-31 20:58:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-31 20:58:05,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 24. [2022-01-31 20:58:05,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:05,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-01-31 20:58:05,998 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2022-01-31 20:58:05,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:06,000 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-01-31 20:58:06,000 INFO L471 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-01-31 20:58:06,000 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-01-31 20:58:06,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-31 20:58:06,001 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:06,002 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:06,004 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 20:58:06,004 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:06,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:06,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1292947397, now seen corresponding path program 1 times [2022-01-31 20:58:06,007 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:06,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1779075531] [2022-01-31 20:58:06,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:06,246 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:06,247 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:06,247 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:06,435 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:06,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1779075531] [2022-01-31 20:58:06,436 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1779075531] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:06,436 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:06,436 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 20:58:06,437 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201376524] [2022-01-31 20:58:06,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:06,437 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 20:58:06,437 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:06,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 20:58:06,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-31 20:58:06,438 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:06,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:06,548 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2022-01-31 20:58:06,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 20:58:06,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 21 [2022-01-31 20:58:06,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:06,550 INFO L225 Difference]: With dead ends: 41 [2022-01-31 20:58:06,550 INFO L226 Difference]: Without dead ends: 25 [2022-01-31 20:58:06,551 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 14 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-01-31 20:58:06,555 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:06,556 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 20:58:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-31 20:58:06,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-31 20:58:06,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 20:58:06,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2022-01-31 20:58:06,569 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 21 [2022-01-31 20:58:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:06,569 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2022-01-31 20:58:06,570 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:06,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-01-31 20:58:06,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-31 20:58:06,570 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 20:58:06,570 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 20:58:06,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 20:58:06,571 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 20:58:06,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 20:58:06,571 INFO L85 PathProgramCache]: Analyzing trace with hash 810760849, now seen corresponding path program 1 times [2022-01-31 20:58:06,571 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 20:58:06,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [765980200] [2022-01-31 20:58:06,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 20:58:06,661 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 1 HavocedVariables, 2 AssignedVariables, 0 ReadonlyVariables, Eigenvalues: {1={1=1, 2=1}}, 1 SequentialAcceleration, 0 AlternatingAcceleration, 1 QuantifierFreeResult [2022-01-31 20:58:06,661 INFO L236 tedInterpolationCore]: Starting analysis with loop acceleration approximation PRECISE [2022-01-31 20:58:06,661 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 20:58:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 20:58:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-01-31 20:58:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 20:58:06,912 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 20:58:06,976 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 20:58:06,976 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [765980200] [2022-01-31 20:58:06,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [765980200] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 20:58:06,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 20:58:06,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-01-31 20:58:06,977 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199490658] [2022-01-31 20:58:06,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 20:58:06,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-31 20:58:06,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 20:58:06,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-31 20:58:06,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2022-01-31 20:58:06,978 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:07,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 20:58:07,133 INFO L93 Difference]: Finished difference Result 26 states and 27 transitions. [2022-01-31 20:58:07,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-31 20:58:07,133 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 22 [2022-01-31 20:58:07,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 20:58:07,134 INFO L225 Difference]: With dead ends: 26 [2022-01-31 20:58:07,134 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 20:58:07,134 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2022-01-31 20:58:07,135 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 15 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 16 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-31 20:58:07,135 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 51 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 42 Invalid, 0 Unknown, 16 Unchecked, 0.0s Time] [2022-01-31 20:58:07,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 20:58:07,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 20:58:07,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-31 20:58:07,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 20:58:07,136 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2022-01-31 20:58:07,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 20:58:07,136 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 20:58:07,137 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 10 states have internal predecessors, (16), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-31 20:58:07,137 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 20:58:07,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 20:58:07,139 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 20:58:07,139 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 20:58:07,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point L15(line 15) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point L15-2(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:58:07,343 INFO L858 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 14 16) no Hoare annotation was computed. [2022-01-31 20:58:07,344 INFO L854 garLoopResultBuilder]: At program point L35-2(lines 35 39) the Hoare annotation is: (let ((.cse2 (div main_~n~0 2))) (let ((.cse0 (+ .cse2 1)) (.cse1 (+ main_~k~0 main_~j~0)) (.cse3 (or (<= 0 main_~n~0) (= (* 2 .cse2) main_~n~0)))) (or (<= .cse0 main_~j~0) (<= .cse0 .cse1) (and (<= .cse2 main_~j~0) .cse3) (and (<= .cse2 .cse1) .cse3)))) [2022-01-31 20:58:07,344 INFO L861 garLoopResultBuilder]: At program point L35-3(lines 35 39) the Hoare annotation is: true [2022-01-31 20:58:07,344 INFO L861 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: true [2022-01-31 20:58:07,344 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 24 41) the Hoare annotation is: true [2022-01-31 20:58:07,344 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 24 41) the Hoare annotation is: true [2022-01-31 20:58:07,344 INFO L854 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (and (<= 1 main_~k~0) (let ((.cse1 (+ main_~k~0 main_~j~0)) (.cse0 (div main_~n~0 2))) (or (<= (+ .cse0 1) .cse1) (and (<= .cse0 .cse1) (or (<= 0 main_~n~0) (= (* 2 .cse0) main_~n~0)))))) [2022-01-31 20:58:07,344 INFO L854 garLoopResultBuilder]: At program point L36-1(line 36) the Hoare annotation is: (and (<= 1 main_~k~0) (let ((.cse1 (+ main_~k~0 main_~j~0)) (.cse0 (div main_~n~0 2))) (or (<= (+ .cse0 1) .cse1) (and (<= .cse0 .cse1) (or (<= 0 main_~n~0) (= (* 2 .cse0) main_~n~0)))))) [2022-01-31 20:58:07,344 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 24 41) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L854 garLoopResultBuilder]: At program point L30-2(lines 30 33) the Hoare annotation is: (or (and (exists ((|v_main_#t~post2_5| Int) (v_main_~k~0_11 Int)) (and (<= main_~n~0 v_main_~k~0_11) (let ((.cse0 (= v_main_~k~0_11 main_~k~0)) (.cse1 (= main_~i~0 0)) (.cse2 (= |main_#t~post2| |v_main_#t~post2_5|))) (or (and (not (< 0 main_~n~0)) .cse0 .cse1 .cse2) (and .cse0 .cse1 .cse2) (and (< v_main_~k~0_11 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 2)) (< main_~k~0 v_main_~k~0_11) (= (* v_main_~k~0_11 2) (+ (* main_~k~0 2) main_~i~0))))))) (<= main_~k~0 main_~n~0)) (and (exists ((|v_main_#t~post2_9| Int) (|v_main_#t~post2_10| Int) (v_main_~k~0_19 Int)) (and (<= main_~n~0 v_main_~k~0_19) (let ((.cse6 (+ main_~k~0 1))) (let ((.cse3 (= main_~i~0 2)) (.cse4 (= |v_main_#t~post2_9| |v_main_#t~post2_10|)) (.cse5 (= v_main_~k~0_19 .cse6))) (or (and .cse3 .cse4 .cse5) (and .cse3 .cse4 .cse5 (<= main_~n~0 0)) (and (= (+ (* main_~k~0 2) main_~i~0) (* v_main_~k~0_19 2)) (< v_main_~k~0_19 (+ (div (+ (- 1) main_~n~0) 2) main_~k~0 3)) (< .cse6 v_main_~k~0_19))))))) (< main_~i~0 (+ main_~n~0 2)))) [2022-01-31 20:58:07,345 INFO L854 garLoopResultBuilder]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (<= main_~n~0 (+ (* main_~k~0 2) 1)) (<= main_~n~0 0)) [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 20:58:07,345 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:58:07,346 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 17 22) the Hoare annotation is: true [2022-01-31 20:58:07,346 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 17 22) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:58:07,346 INFO L854 garLoopResultBuilder]: At program point L19(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:58:07,346 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 19) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-01-31 20:58:07,346 INFO L854 garLoopResultBuilder]: At program point L18(lines 18 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-01-31 20:58:07,348 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-01-31 20:58:07,349 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 20:58:07,354 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,354 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,355 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,356 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,361 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,362 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,363 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,364 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:58:07 BoogieIcfgContainer [2022-01-31 20:58:07,365 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 20:58:07,365 INFO L158 Benchmark]: Toolchain (without parser) took 2871.08ms. Allocated memory was 225.4MB in the beginning and 320.9MB in the end (delta: 95.4MB). Free memory was 177.9MB in the beginning and 219.9MB in the end (delta: -42.0MB). Peak memory consumption was 54.3MB. Max. memory is 8.0GB. [2022-01-31 20:58:07,365 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory is still 193.9MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 20:58:07,365 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.04ms. Allocated memory is still 225.4MB. Free memory was 177.7MB in the beginning and 203.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. [2022-01-31 20:58:07,366 INFO L158 Benchmark]: Boogie Preprocessor took 30.26ms. Allocated memory is still 225.4MB. Free memory was 203.5MB in the beginning and 202.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-01-31 20:58:07,366 INFO L158 Benchmark]: RCFGBuilder took 215.80ms. Allocated memory is still 225.4MB. Free memory was 202.0MB in the beginning and 191.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-01-31 20:58:07,366 INFO L158 Benchmark]: TraceAbstraction took 2440.63ms. Allocated memory was 225.4MB in the beginning and 320.9MB in the end (delta: 95.4MB). Free memory was 190.4MB in the beginning and 219.9MB in the end (delta: -29.4MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. [2022-01-31 20:58:07,367 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 225.4MB. Free memory is still 193.9MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 181.04ms. Allocated memory is still 225.4MB. Free memory was 177.7MB in the beginning and 203.5MB in the end (delta: -25.8MB). Peak memory consumption was 10.8MB. Max. memory is 8.0GB. * Boogie Preprocessor took 30.26ms. Allocated memory is still 225.4MB. Free memory was 203.5MB in the beginning and 202.5MB in the end (delta: 1.0MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 215.80ms. Allocated memory is still 225.4MB. Free memory was 202.0MB in the beginning and 191.0MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2440.63ms. Allocated memory was 225.4MB in the beginning and 320.9MB in the end (delta: 95.4MB). Free memory was 190.4MB in the beginning and 219.9MB in the end (delta: -29.4MB). Peak memory consumption was 66.5MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 19]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.4s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.2s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 85 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 82 mSDsluCounter, 198 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 55 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 270 IncrementalHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 64 mSDtfsCounter, 270 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 83 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 117 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=26occurred in iteration=1, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 23 LocationsWithAnnotation, 47 PreInvPairs, 69 NumberOfFragments, 301 HoareAnnotationTreeSize, 47 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 23 FomulaSimplificationsInter, 448 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,372 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,373 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_5,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_11,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,374 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_9,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_#t~post2_10,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] [2022-01-31 20:58:07,375 WARN L418 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~k~0_19,QUANTIFIED] Derived loop invariant: ((\exists v_main_#t~post2_5 : int, v_main_~k~0_11 : int :: n <= v_main_~k~0_11 && (((((!(0 < n) && v_main_~k~0_11 == k) && i == 0) && aux-k---aux == v_main_#t~post2_5) || ((v_main_~k~0_11 == k && i == 0) && aux-k---aux == v_main_#t~post2_5)) || ((v_main_~k~0_11 < (-1 + n) / 2 + k + 2 && k < v_main_~k~0_11) && v_main_~k~0_11 * 2 == k * 2 + i))) && k <= n) || ((\exists v_main_#t~post2_9 : int, v_main_#t~post2_10 : int, v_main_~k~0_19 : int :: n <= v_main_~k~0_19 && ((((i == 2 && v_main_#t~post2_9 == v_main_#t~post2_10) && v_main_~k~0_19 == k + 1) || (((i == 2 && v_main_#t~post2_9 == v_main_#t~post2_10) && v_main_~k~0_19 == k + 1) && n <= 0)) || ((k * 2 + i == v_main_~k~0_19 * 2 && v_main_~k~0_19 < (-1 + n) / 2 + k + 3) && k + 1 < v_main_~k~0_19))) && i < n + 2) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((n / 2 + 1 <= j || n / 2 + 1 <= k + j) || (n / 2 <= j && (0 <= n || 2 * (n / 2) == n))) || (n / 2 <= k + j && (0 <= n || 2 * (n / 2) == n)) - ProcedureContractResult [Line: 24]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 17]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-01-31 20:58:07,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...