/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/array-examples/data_structures_set_multi_proc_trivial_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-d966a43 [2022-01-31 17:01:10,606 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-31 17:01:10,608 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-31 17:01:10,647 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-31 17:01:10,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-31 17:01:10,667 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-31 17:01:10,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-31 17:01:10,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-31 17:01:10,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-31 17:01:10,675 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-31 17:01:10,676 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-31 17:01:10,677 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-31 17:01:10,677 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-31 17:01:10,678 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-31 17:01:10,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-31 17:01:10,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-31 17:01:10,680 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-31 17:01:10,681 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-31 17:01:10,682 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-31 17:01:10,690 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-31 17:01:10,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-31 17:01:10,700 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-31 17:01:10,701 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-31 17:01:10,702 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-31 17:01:10,704 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-31 17:01:10,704 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-31 17:01:10,704 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-31 17:01:10,705 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-31 17:01:10,705 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-31 17:01:10,706 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-31 17:01:10,706 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-31 17:01:10,707 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-31 17:01:10,707 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-31 17:01:10,708 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-31 17:01:10,709 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-31 17:01:10,709 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-31 17:01:10,710 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-31 17:01:10,710 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-31 17:01:10,710 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-31 17:01:10,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-31 17:01:10,718 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-31 17:01:10,721 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 17:01:10,737 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-31 17:01:10,737 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-31 17:01:10,739 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-31 17:01:10,739 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-31 17:01:10,739 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-31 17:01:10,739 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-31 17:01:10,739 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-31 17:01:10,740 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-31 17:01:10,740 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-31 17:01:10,740 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-31 17:01:10,741 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-31 17:01:10,741 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-31 17:01:10,742 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-31 17:01:10,742 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 17:01:10,742 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-31 17:01:10,742 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-01-31 17:01:10,742 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-31 17:01:10,742 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-01-31 17:01:10,742 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 17:01:10,964 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-31 17:01:10,981 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-31 17:01:10,984 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-31 17:01:10,985 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-31 17:01:10,987 INFO L275 PluginConnector]: CDTParser initialized [2022-01-31 17:01:10,988 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-01-31 17:01:11,039 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b5cab3/1babf46d59d8418c82b6548e35547d7f/FLAG66aa5b635 [2022-01-31 17:01:11,425 INFO L306 CDTParser]: Found 1 translation units. [2022-01-31 17:01:11,426 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i [2022-01-31 17:01:11,441 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b5cab3/1babf46d59d8418c82b6548e35547d7f/FLAG66aa5b635 [2022-01-31 17:01:11,460 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/740b5cab3/1babf46d59d8418c82b6548e35547d7f [2022-01-31 17:01:11,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-31 17:01:11,465 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-01-31 17:01:11,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-31 17:01:11,468 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-31 17:01:11,471 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-31 17:01:11,471 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,472 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51beec69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11, skipping insertion in model container [2022-01-31 17:01:11,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,478 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-31 17:01:11,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-31 17:01:11,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-01-31 17:01:11,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 17:01:11,709 INFO L203 MainTranslator]: Completed pre-run [2022-01-31 17:01:11,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/array-examples/data_structures_set_multi_proc_trivial_ground.i[838,851] [2022-01-31 17:01:11,729 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-31 17:01:11,738 INFO L208 MainTranslator]: Completed translation [2022-01-31 17:01:11,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11 WrapperNode [2022-01-31 17:01:11,738 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-31 17:01:11,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-31 17:01:11,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-31 17:01:11,740 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-31 17:01:11,748 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,748 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,754 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,765 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,776 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,777 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,780 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-31 17:01:11,781 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-31 17:01:11,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-31 17:01:11,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-31 17:01:11,784 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (1/1) ... [2022-01-31 17:01:11,794 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-31 17:01:11,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-31 17:01:11,813 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 17:01:11,815 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 17:01:11,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-01-31 17:01:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-31 17:01:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-01-31 17:01:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-01-31 17:01:11,845 INFO L138 BoogieDeclarations]: Found implementation of procedure insert [2022-01-31 17:01:11,846 INFO L138 BoogieDeclarations]: Found implementation of procedure elem_exists [2022-01-31 17:01:11,846 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-01-31 17:01:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-01-31 17:01:11,846 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-01-31 17:01:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-01-31 17:01:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-01-31 17:01:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-01-31 17:01:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-31 17:01:11,847 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-01-31 17:01:11,848 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure insert [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure elem_exists [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-31 17:01:11,850 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-01-31 17:01:11,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-31 17:01:11,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-31 17:01:11,919 INFO L234 CfgBuilder]: Building ICFG [2022-01-31 17:01:11,921 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-31 17:01:12,181 INFO L275 CfgBuilder]: Performing block encoding [2022-01-31 17:01:12,186 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-31 17:01:12,187 INFO L299 CfgBuilder]: Removed 10 assume(true) statements. [2022-01-31 17:01:12,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:01:12 BoogieIcfgContainer [2022-01-31 17:01:12,188 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-31 17:01:12,190 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-31 17:01:12,190 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-31 17:01:12,193 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-31 17:01:12,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 05:01:11" (1/3) ... [2022-01-31 17:01:12,194 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24144fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:01:12, skipping insertion in model container [2022-01-31 17:01:12,194 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 05:01:11" (2/3) ... [2022-01-31 17:01:12,195 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24144fb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 05:01:12, skipping insertion in model container [2022-01-31 17:01:12,195 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 05:01:12" (3/3) ... [2022-01-31 17:01:12,196 INFO L111 eAbstractionObserver]: Analyzing ICFG data_structures_set_multi_proc_trivial_ground.i [2022-01-31 17:01:12,200 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-01-31 17:01:12,201 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-31 17:01:12,239 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-31 17:01:12,247 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 17:01:12,248 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-31 17:01:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 48 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-01-31 17:01:12,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-31 17:01:12,268 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:12,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:12,270 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:12,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:12,274 INFO L85 PathProgramCache]: Analyzing trace with hash 183486019, now seen corresponding path program 1 times [2022-01-31 17:01:12,281 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:12,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [524373960] [2022-01-31 17:01:12,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:12,296 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:12,340 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:12,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:12,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:12,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:12,496 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 17:01:12,497 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:12,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [524373960] [2022-01-31 17:01:12,499 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [524373960] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:12,499 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:12,499 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-31 17:01:12,500 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770784748] [2022-01-31 17:01:12,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:12,503 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-31 17:01:12,503 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:12,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-31 17:01:12,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-31 17:01:12,529 INFO L87 Difference]: Start difference. First operand has 61 states, 47 states have (on average 1.5106382978723405) internal successors, (71), 48 states have internal predecessors, (71), 7 states have call successors, (7), 5 states have call predecessors, (7), 5 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 17:01:12,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:12,823 INFO L93 Difference]: Finished difference Result 150 states and 228 transitions. [2022-01-31 17:01:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-31 17:01:12,826 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 17:01:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:12,835 INFO L225 Difference]: With dead ends: 150 [2022-01-31 17:01:12,836 INFO L226 Difference]: Without dead ends: 89 [2022-01-31 17:01:12,840 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-31 17:01:12,846 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:12,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 66 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 17:01:12,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-01-31 17:01:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 57. [2022-01-31 17:01:12,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 17:01:12,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 70 transitions. [2022-01-31 17:01:12,887 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 70 transitions. Word has length 14 [2022-01-31 17:01:12,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:12,888 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 70 transitions. [2022-01-31 17:01:12,888 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 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 17:01:12,888 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 70 transitions. [2022-01-31 17:01:12,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-31 17:01:12,889 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:12,889 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:12,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-31 17:01:12,890 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:12,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:12,891 INFO L85 PathProgramCache]: Analyzing trace with hash -210736667, now seen corresponding path program 1 times [2022-01-31 17:01:12,891 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:12,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1512641067] [2022-01-31 17:01:12,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:12,914 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:12,915 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:12,915 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:12,920 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:12,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:12,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:12,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,000 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 17:01:13,001 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:13,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1512641067] [2022-01-31 17:01:13,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1512641067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:13,001 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:13,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 17:01:13,002 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1115008641] [2022-01-31 17:01:13,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:13,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 17:01:13,003 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:13,003 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 17:01:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 17:01:13,003 INFO L87 Difference]: Start difference. First operand 57 states and 70 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17:01:13,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:13,293 INFO L93 Difference]: Finished difference Result 170 states and 222 transitions. [2022-01-31 17:01:13,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 17:01:13,294 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 16 [2022-01-31 17:01:13,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:13,300 INFO L225 Difference]: With dead ends: 170 [2022-01-31 17:01:13,300 INFO L226 Difference]: Without dead ends: 122 [2022-01-31 17:01:13,305 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 17:01:13,307 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 198 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:13,307 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 62 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 17:01:13,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-01-31 17:01:13,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 59. [2022-01-31 17:01:13,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 47 states have internal predecessors, (59), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 17:01:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 72 transitions. [2022-01-31 17:01:13,330 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 72 transitions. Word has length 16 [2022-01-31 17:01:13,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:13,330 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 72 transitions. [2022-01-31 17:01:13,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17:01:13,330 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 72 transitions. [2022-01-31 17:01:13,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-31 17:01:13,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:13,331 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:13,331 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-31 17:01:13,332 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:13,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:13,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1101615865, now seen corresponding path program 2 times [2022-01-31 17:01:13,332 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:13,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2121306878] [2022-01-31 17:01:13,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:13,336 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:13,336 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:13,336 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:13,337 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:13,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:13,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-31 17:01:13,407 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:13,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2121306878] [2022-01-31 17:01:13,408 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [2121306878] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:13,408 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:13,408 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 17:01:13,408 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860173345] [2022-01-31 17:01:13,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:13,409 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 17:01:13,409 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:13,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 17:01:13,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-01-31 17:01:13,410 INFO L87 Difference]: Start difference. First operand 59 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17:01:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:13,552 INFO L93 Difference]: Finished difference Result 112 states and 140 transitions. [2022-01-31 17:01:13,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-31 17:01:13,552 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 18 [2022-01-31 17:01:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:13,553 INFO L225 Difference]: With dead ends: 112 [2022-01-31 17:01:13,553 INFO L226 Difference]: Without dead ends: 63 [2022-01-31 17:01:13,554 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-01-31 17:01:13,555 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 74 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:13,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 65 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 17:01:13,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-31 17:01:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-01-31 17:01:13,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 49 states have internal predecessors, (60), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 17:01:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 73 transitions. [2022-01-31 17:01:13,568 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 73 transitions. Word has length 18 [2022-01-31 17:01:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:13,568 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 73 transitions. [2022-01-31 17:01:13,568 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 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 17:01:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 73 transitions. [2022-01-31 17:01:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-31 17:01:13,569 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:13,569 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:13,570 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-31 17:01:13,570 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:13,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:13,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1049624209, now seen corresponding path program 1 times [2022-01-31 17:01:13,570 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:13,571 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1438255317] [2022-01-31 17:01:13,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:13,573 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:13,574 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:13,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:13,575 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:13,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:13,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-01-31 17:01:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-01-31 17:01:13,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,667 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 17:01:13,668 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:13,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1438255317] [2022-01-31 17:01:13,668 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1438255317] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:13,668 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:13,668 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-31 17:01:13,668 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339154327] [2022-01-31 17:01:13,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:13,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-31 17:01:13,669 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:13,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-31 17:01:13,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-31 17:01:13,670 INFO L87 Difference]: Start difference. First operand 61 states and 73 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:13,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:13,814 INFO L93 Difference]: Finished difference Result 125 states and 154 transitions. [2022-01-31 17:01:13,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-31 17:01:13,815 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 37 [2022-01-31 17:01:13,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:13,816 INFO L225 Difference]: With dead ends: 125 [2022-01-31 17:01:13,816 INFO L226 Difference]: Without dead ends: 80 [2022-01-31 17:01:13,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-01-31 17:01:13,818 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 90 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:13,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 50 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 17:01:13,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-31 17:01:13,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 62. [2022-01-31 17:01:13,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-31 17:01:13,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 74 transitions. [2022-01-31 17:01:13,856 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 74 transitions. Word has length 37 [2022-01-31 17:01:13,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:13,857 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 74 transitions. [2022-01-31 17:01:13,857 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 3 states have internal predecessors, (27), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:13,857 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 74 transitions. [2022-01-31 17:01:13,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-31 17:01:13,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:13,858 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:13,858 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-31 17:01:13,859 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:13,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:13,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1502959087, now seen corresponding path program 1 times [2022-01-31 17:01:13,865 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:13,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1892898799] [2022-01-31 17:01:13,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:13,868 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:13,868 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:13,868 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:13,870 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-01-31 17:01:13,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-01-31 17:01:13,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,008 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 17:01:14,008 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:14,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1892898799] [2022-01-31 17:01:14,009 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1892898799] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:14,009 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:14,009 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 17:01:14,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638508518] [2022-01-31 17:01:14,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:14,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 17:01:14,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:14,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 17:01:14,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-31 17:01:14,013 INFO L87 Difference]: Start difference. First operand 62 states and 74 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:14,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:14,224 INFO L93 Difference]: Finished difference Result 148 states and 186 transitions. [2022-01-31 17:01:14,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 17:01:14,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 39 [2022-01-31 17:01:14,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:14,226 INFO L225 Difference]: With dead ends: 148 [2022-01-31 17:01:14,227 INFO L226 Difference]: Without dead ends: 103 [2022-01-31 17:01:14,228 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-01-31 17:01:14,230 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 118 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:14,231 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 52 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-31 17:01:14,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-31 17:01:14,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 79. [2022-01-31 17:01:14,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 64 states have (on average 1.21875) internal successors, (78), 64 states have internal predecessors, (78), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-01-31 17:01:14,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 97 transitions. [2022-01-31 17:01:14,266 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 97 transitions. Word has length 39 [2022-01-31 17:01:14,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:14,266 INFO L470 AbstractCegarLoop]: Abstraction has 79 states and 97 transitions. [2022-01-31 17:01:14,266 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:14,266 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-01-31 17:01:14,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 17:01:14,272 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:14,272 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:14,272 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-31 17:01:14,273 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:14,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:14,273 INFO L85 PathProgramCache]: Analyzing trace with hash -928887347, now seen corresponding path program 2 times [2022-01-31 17:01:14,273 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:14,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1957200954] [2022-01-31 17:01:14,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:14,280 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:14,280 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:14,280 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:14,281 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:14,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 17:01:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 17:01:14,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,400 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 17:01:14,401 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:14,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1957200954] [2022-01-31 17:01:14,401 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1957200954] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:14,401 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:14,401 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-31 17:01:14,401 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621061137] [2022-01-31 17:01:14,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:14,402 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-31 17:01:14,402 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:14,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-31 17:01:14,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-31 17:01:14,403 INFO L87 Difference]: Start difference. First operand 79 states and 97 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:14,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:14,558 INFO L93 Difference]: Finished difference Result 135 states and 170 transitions. [2022-01-31 17:01:14,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-31 17:01:14,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 41 [2022-01-31 17:01:14,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:14,561 INFO L225 Difference]: With dead ends: 135 [2022-01-31 17:01:14,562 INFO L226 Difference]: Without dead ends: 87 [2022-01-31 17:01:14,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-01-31 17:01:14,565 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 65 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:14,569 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 55 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 17:01:14,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-01-31 17:01:14,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-01-31 17:01:14,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 68 states have internal predecessors, (83), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2022-01-31 17:01:14,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 105 transitions. [2022-01-31 17:01:14,592 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 105 transitions. Word has length 41 [2022-01-31 17:01:14,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:14,592 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 105 transitions. [2022-01-31 17:01:14,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 2 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-31 17:01:14,593 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 105 transitions. [2022-01-31 17:01:14,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-01-31 17:01:14,596 INFO L506 BasicCegarLoop]: Found error trace [2022-01-31 17:01:14,597 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-31 17:01:14,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-31 17:01:14,597 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-31 17:01:14,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-31 17:01:14,598 INFO L85 PathProgramCache]: Analyzing trace with hash 488701956, now seen corresponding path program 1 times [2022-01-31 17:01:14,598 INFO L121 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-01-31 17:01:14,598 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1615749060] [2022-01-31 17:01:14,598 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-31 17:01:14,600 INFO L87 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-01-31 17:01:14,601 WARN L89 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-01-31 17:01:14,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-31 17:01:14,603 INFO L248 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-01-31 17:01:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-01-31 17:01:14,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-01-31 17:01:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-01-31 17:01:14,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-31 17:01:14,685 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 17:01:14,685 INFO L139 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-01-31 17:01:14,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1615749060] [2022-01-31 17:01:14,685 INFO L160 FreeRefinementEngine]: IpTcStrategyModulePreferences [1615749060] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-31 17:01:14,686 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-31 17:01:14,686 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-31 17:01:14,686 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862001889] [2022-01-31 17:01:14,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-31 17:01:14,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-31 17:01:14,686 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-01-31 17:01:14,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-31 17:01:14,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-31 17:01:14,687 INFO L87 Difference]: Start difference. First operand 85 states and 105 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 17:01:14,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-31 17:01:14,797 INFO L93 Difference]: Finished difference Result 105 states and 129 transitions. [2022-01-31 17:01:14,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-31 17:01:14,798 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 41 [2022-01-31 17:01:14,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-31 17:01:14,798 INFO L225 Difference]: With dead ends: 105 [2022-01-31 17:01:14,798 INFO L226 Difference]: Without dead ends: 0 [2022-01-31 17:01:14,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-01-31 17:01:14,800 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-31 17:01:14,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 32 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-31 17:01:14,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-31 17:01:14,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-31 17:01:14,801 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 17:01:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-31 17:01:14,801 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 41 [2022-01-31 17:01:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-31 17:01:14,802 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-31 17:01:14,802 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-31 17:01:14,802 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-31 17:01:14,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-31 17:01:14,804 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-31 17:01:14,805 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-31 17:01:14,807 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-01-31 17:01:15,262 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2022-01-31 17:01:15,262 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 12) no Hoare annotation was computed. [2022-01-31 17:01:15,262 INFO L858 garLoopResultBuilder]: For program point L12-1(line 12) no Hoare annotation was computed. [2022-01-31 17:01:15,262 INFO L861 garLoopResultBuilder]: At program point elem_existsENTRY(lines 20 26) the Hoare annotation is: true [2022-01-31 17:01:15,263 INFO L854 garLoopResultBuilder]: At program point elem_existsEXIT(lines 20 26) the Hoare annotation is: (let ((.cse0 (<= 0 elem_exists_~i~0)) (.cse1 (= elem_exists_~size |elem_exists_#in~size|))) (or (and (<= 1 |elem_exists_#in~size|) .cse0 .cse1) (and (<= 0 |elem_exists_#res|) .cse0 .cse1 (<= |elem_exists_#res| 0)))) [2022-01-31 17:01:15,263 INFO L854 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: (and (<= 1 |elem_exists_#in~size|) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2022-01-31 17:01:15,264 INFO L854 garLoopResultBuilder]: At program point L22-2(lines 22 24) the Hoare annotation is: (and (<= 1 |elem_exists_#in~size|) (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2022-01-31 17:01:15,264 INFO L854 garLoopResultBuilder]: At program point L22-3(lines 22 24) the Hoare annotation is: (and (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2022-01-31 17:01:15,264 INFO L854 garLoopResultBuilder]: At program point L22-4(lines 22 24) the Hoare annotation is: (and (<= 0 elem_exists_~i~0) (= elem_exists_~size |elem_exists_#in~size|)) [2022-01-31 17:01:15,264 INFO L854 garLoopResultBuilder]: At program point elem_existsFINAL(lines 20 26) the Hoare annotation is: (let ((.cse0 (<= 0 elem_exists_~i~0)) (.cse1 (= elem_exists_~size |elem_exists_#in~size|))) (or (and (<= 1 |elem_exists_#in~size|) .cse0 .cse1) (and (<= 0 |elem_exists_#res|) .cse0 .cse1 (<= |elem_exists_#res| 0)))) [2022-01-31 17:01:15,264 INFO L861 garLoopResultBuilder]: At program point insertENTRY(lines 16 19) the Hoare annotation is: true [2022-01-31 17:01:15,264 INFO L861 garLoopResultBuilder]: At program point insertFINAL(lines 16 19) the Hoare annotation is: true [2022-01-31 17:01:15,265 INFO L861 garLoopResultBuilder]: At program point insertEXIT(lines 16 19) the Hoare annotation is: true [2022-01-31 17:01:15,265 INFO L861 garLoopResultBuilder]: At program point mainEXIT(lines 27 67) the Hoare annotation is: true [2022-01-31 17:01:15,265 INFO L854 garLoopResultBuilder]: At program point L52(line 52) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,265 INFO L854 garLoopResultBuilder]: At program point L52-1(line 52) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0) (= |main_#t~ret13| 0)) [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L52-2(lines 52 54) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0) (= |main_#t~ret13| 0)) [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L52-4(lines 52 54) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L61-2(lines 61 65) the Hoare annotation is: false [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L61-3(lines 61 65) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,266 INFO L861 garLoopResultBuilder]: At program point L61-4(lines 61 65) the Hoare annotation is: true [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L53(line 53) the Hoare annotation is: false [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L53-1(line 53) the Hoare annotation is: false [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L62-2(lines 62 64) the Hoare annotation is: false [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L62-3(lines 62 64) the Hoare annotation is: false [2022-01-31 17:01:15,266 INFO L861 garLoopResultBuilder]: At program point mainFINAL(lines 27 67) the Hoare annotation is: true [2022-01-31 17:01:15,266 INFO L854 garLoopResultBuilder]: At program point L63(line 63) the Hoare annotation is: false [2022-01-31 17:01:15,267 INFO L854 garLoopResultBuilder]: At program point L63-1(line 63) the Hoare annotation is: false [2022-01-31 17:01:15,267 INFO L854 garLoopResultBuilder]: At program point mainENTRY(lines 27 67) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2022-01-31 17:01:15,267 INFO L854 garLoopResultBuilder]: At program point L55-2(lines 55 59) the Hoare annotation is: false [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L55-3(lines 55 59) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L47-2(lines 47 50) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L47-3(lines 47 50) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L47-4(lines 47 50) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L39-2(lines 39 43) the Hoare annotation is: false [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L39-3(lines 39 43) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L39-4(lines 39 43) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L56-2(lines 56 58) the Hoare annotation is: false [2022-01-31 17:01:15,268 INFO L854 garLoopResultBuilder]: At program point L56-3(lines 56 58) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L40-2(lines 40 42) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L40-3(lines 40 42) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L57-1(line 57) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L41(line 41) the Hoare annotation is: false [2022-01-31 17:01:15,269 INFO L854 garLoopResultBuilder]: At program point L41-1(line 41) the Hoare annotation is: false [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L33-2(lines 33 36) the Hoare annotation is: (= main_~n~0 0) [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L33-3(lines 33 36) the Hoare annotation is: (= main_~n~0 0) [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L33-4(lines 33 36) the Hoare annotation is: (= main_~n~0 0) [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L51-2(lines 51 60) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L51-3(lines 51 60) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,270 INFO L854 garLoopResultBuilder]: At program point L51-4(lines 51 60) the Hoare annotation is: (and (= main_~x~0 0) (= main_~n~0 0)) [2022-01-31 17:01:15,270 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 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 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point L13(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point L13-1(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point L13-3(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,271 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,272 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 13) the Hoare annotation is: true [2022-01-31 17:01:15,276 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1] [2022-01-31 17:01:15,277 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-01-31 17:01:15,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 05:01:15 BoogieIcfgContainer [2022-01-31 17:01:15,294 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-31 17:01:15,295 INFO L158 Benchmark]: Toolchain (without parser) took 3830.12ms. Allocated memory was 205.5MB in the beginning and 294.6MB in the end (delta: 89.1MB). Free memory was 150.1MB in the beginning and 130.1MB in the end (delta: 20.0MB). Peak memory consumption was 110.1MB. Max. memory is 8.0GB. [2022-01-31 17:01:15,295 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 205.5MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-01-31 17:01:15,295 INFO L158 Benchmark]: CACSL2BoogieTranslator took 271.43ms. Allocated memory is still 205.5MB. Free memory was 149.8MB in the beginning and 175.4MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. [2022-01-31 17:01:15,295 INFO L158 Benchmark]: Boogie Preprocessor took 40.56ms. Allocated memory is still 205.5MB. Free memory was 175.4MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-31 17:01:15,295 INFO L158 Benchmark]: RCFGBuilder took 407.87ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 159.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-31 17:01:15,296 INFO L158 Benchmark]: TraceAbstraction took 3103.89ms. Allocated memory was 205.5MB in the beginning and 294.6MB in the end (delta: 89.1MB). Free memory was 158.6MB in the beginning and 130.1MB in the end (delta: 28.5MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. [2022-01-31 17:01:15,298 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.14ms. Allocated memory is still 205.5MB. Free memory was 166.9MB in the beginning and 166.8MB in the end (delta: 136.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 271.43ms. Allocated memory is still 205.5MB. Free memory was 149.8MB in the beginning and 175.4MB in the end (delta: -25.5MB). Peak memory consumption was 9.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.56ms. Allocated memory is still 205.5MB. Free memory was 175.4MB in the beginning and 173.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 407.87ms. Allocated memory is still 205.5MB. Free memory was 173.3MB in the beginning and 159.1MB in the end (delta: 14.2MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 3103.89ms. Allocated memory was 205.5MB in the beginning and 294.6MB in the end (delta: 89.1MB). Free memory was 158.6MB in the beginning and 130.1MB in the end (delta: 28.5MB). Peak memory consumption was 118.7MB. Max. memory is 8.0GB. * 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: 13]: 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 7 procedures, 64 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 3.0s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.5s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 742 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 715 mSDsluCounter, 382 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 44 mSDsCounter, 217 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 888 IncrementalHoareTripleChecker+Invalid, 1105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 217 mSolverCounterUnsat, 338 mSDtfsCounter, 888 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 79 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=85occurred in iteration=6, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 7 MinimizatonAttempts, 141 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 61 LocationsWithAnnotation, 270 PreInvPairs, 319 NumberOfFragments, 241 HoareAnnotationTreeSize, 270 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 61 FomulaSimplificationsInter, 595 FormulaSimplificationTreeSizeReductionInter, 0.3s 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: 61]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: n == 0 - InvariantResult [Line: 39]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 22]: Loop Invariant Derived loop invariant: 0 <= i && size == \old(size) - InvariantResult [Line: 47]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 62]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 51]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: x == 0 && n == 0 - InvariantResult [Line: 56]: Loop Invariant Derived loop invariant: 0 - ProcedureContractResult [Line: 20]: Procedure Contract for elem_exists Derived contract for procedure elem_exists: ((1 <= \old(size) && 0 <= i) && size == \old(size)) || (((0 <= \result && 0 <= i) && size == \old(size)) && \result <= 0) - ProcedureContractResult [Line: 16]: Procedure Contract for insert Derived contract for procedure insert: 1 - ProcedureContractResult [Line: 27]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 13]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: 1 RESULT: Ultimate proved your program to be correct! [2022-01-31 17:01:15,350 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...