./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 01:34:37,590 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 01:34:37,677 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 01:34:37,684 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 01:34:37,685 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 01:34:37,717 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 01:34:37,718 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 01:34:37,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 01:34:37,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 01:34:37,720 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 01:34:37,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 01:34:37,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 01:34:37,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 01:34:37,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 01:34:37,722 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 01:34:37,722 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 01:34:37,723 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 01:34:37,723 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 01:34:37,723 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 01:34:37,724 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 01:34:37,724 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 01:34:37,728 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 01:34:37,729 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 01:34:37,729 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 01:34:37,729 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 01:34:37,729 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 01:34:37,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 01:34:37,730 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 01:34:37,730 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 01:34:37,730 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 01:34:37,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 01:34:37,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 01:34:37,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:37,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 01:34:37,732 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 01:34:37,732 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 01:34:37,733 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 01:34:37,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 01:34:37,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 01:34:37,735 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 01:34:37,735 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 01:34:37,736 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 01:34:37,736 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-clean/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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 10aecdd717bb6691571ad1da0b912f030832fb85361f767ea82293acfe046216 [2024-10-11 01:34:37,988 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 01:34:38,016 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 01:34:38,021 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 01:34:38,023 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 01:34:38,023 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 01:34:38,024 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-10-11 01:34:39,455 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 01:34:39,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 01:34:39,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-10-11 01:34:39,735 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1db399e9/e0234c7e22e94bf3b3238f05f48f5af0/FLAG73beaa71a [2024-10-11 01:34:39,748 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/d1db399e9/e0234c7e22e94bf3b3238f05f48f5af0 [2024-10-11 01:34:39,751 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 01:34:39,752 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 01:34:39,756 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:39,756 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 01:34:39,762 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 01:34:39,762 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:39" (1/1) ... [2024-10-11 01:34:39,763 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3963f275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:39, skipping insertion in model container [2024-10-11 01:34:39,764 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:34:39" (1/1) ... [2024-10-11 01:34:39,800 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 01:34:40,095 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-10-11 01:34:40,102 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-10-11 01:34:40,103 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-10-11 01:34:40,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:40,135 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 01:34:40,214 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26271,26284] [2024-10-11 01:34:40,218 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26396,26409] [2024-10-11 01:34:40,219 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i[26511,26524] [2024-10-11 01:34:40,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 01:34:40,275 INFO L204 MainTranslator]: Completed translation [2024-10-11 01:34:40,275 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40 WrapperNode [2024-10-11 01:34:40,276 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 01:34:40,277 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:40,277 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 01:34:40,277 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 01:34:40,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,298 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,330 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 186 [2024-10-11 01:34:40,333 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 01:34:40,334 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 01:34:40,334 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 01:34:40,334 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 01:34:40,346 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,347 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,357 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,415 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2024-10-11 01:34:40,417 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,417 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,432 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,438 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,440 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,442 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,447 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 01:34:40,448 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 01:34:40,448 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 01:34:40,449 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 01:34:40,449 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (1/1) ... [2024-10-11 01:34:40,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 01:34:40,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:40,478 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 01:34:40,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 01:34:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-10-11 01:34:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-10-11 01:34:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-10-11 01:34:40,525 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-10-11 01:34:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 01:34:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 01:34:40,525 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 01:34:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 01:34:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-10-11 01:34:40,526 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-10-11 01:34:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 01:34:40,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 01:34:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 01:34:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-10-11 01:34:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-10-11 01:34:40,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 01:34:40,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 01:34:40,545 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-10-11 01:34:40,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-10-11 01:34:40,546 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 01:34:40,546 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 01:34:40,691 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 01:34:40,693 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 01:34:41,013 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-10-11 01:34:41,013 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 01:34:41,082 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 01:34:41,083 INFO L314 CfgBuilder]: Removed 5 assume(true) statements. [2024-10-11 01:34:41,083 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:41 BoogieIcfgContainer [2024-10-11 01:34:41,084 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 01:34:41,086 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 01:34:41,086 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 01:34:41,090 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 01:34:41,090 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:34:39" (1/3) ... [2024-10-11 01:34:41,091 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3983c9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:41, skipping insertion in model container [2024-10-11 01:34:41,091 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:34:40" (2/3) ... [2024-10-11 01:34:41,093 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3983c9bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:34:41, skipping insertion in model container [2024-10-11 01:34:41,093 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:34:41" (3/3) ... [2024-10-11 01:34:41,095 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2024-10-11 01:34:41,110 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 01:34:41,110 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-10-11 01:34:41,167 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 01:34:41,174 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@6a6321de, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 01:34:41,174 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-10-11 01:34:41,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 40 states have (on average 1.5) internal successors, (60), 43 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:34:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:34:41,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,189 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,195 INFO L85 PathProgramCache]: Analyzing trace with hash -938663332, now seen corresponding path program 1 times [2024-10-11 01:34:41,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466985600] [2024-10-11 01:34:41,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:41,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:41,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:41,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:41,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466985600] [2024-10-11 01:34:41,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466985600] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:41,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:41,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 01:34:41,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424158029] [2024-10-11 01:34:41,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:41,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 01:34:41,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:41,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 01:34:41,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:34:41,426 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.5) internal successors, (60), 43 states have internal predecessors, (60), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-11 01:34:41,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:41,497 INFO L93 Difference]: Finished difference Result 111 states and 156 transitions. [2024-10-11 01:34:41,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 01:34:41,501 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) Word has length 9 [2024-10-11 01:34:41,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:41,510 INFO L225 Difference]: With dead ends: 111 [2024-10-11 01:34:41,510 INFO L226 Difference]: Without dead ends: 54 [2024-10-11 01:34:41,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 01:34:41,520 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:41,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 01:34:41,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-10-11 01:34:41,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-10-11 01:34:41,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 41 states have internal predecessors, (49), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-10-11 01:34:41,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-10-11 01:34:41,566 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 9 [2024-10-11 01:34:41,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:41,567 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-10-11 01:34:41,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 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) [2024-10-11 01:34:41,569 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-10-11 01:34:41,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 01:34:41,570 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 01:34:41,571 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,572 INFO L85 PathProgramCache]: Analyzing trace with hash -1186897498, now seen corresponding path program 1 times [2024-10-11 01:34:41,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148382849] [2024-10-11 01:34:41,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:41,772 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:41,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:41,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148382849] [2024-10-11 01:34:41,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148382849] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:41,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:41,775 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 01:34:41,775 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570292381] [2024-10-11 01:34:41,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:41,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:34:41,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:41,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:34:41,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:34:41,778 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 01:34:41,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:41,946 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2024-10-11 01:34:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:34:41,950 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2024-10-11 01:34:41,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:41,953 INFO L225 Difference]: With dead ends: 101 [2024-10-11 01:34:41,953 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 01:34:41,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 01:34:41,956 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 47 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:41,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 126 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:34:41,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 01:34:41,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 81. [2024-10-11 01:34:41,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 64 states have internal predecessors, (81), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-10-11 01:34:41,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 103 transitions. [2024-10-11 01:34:41,980 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 103 transitions. Word has length 9 [2024-10-11 01:34:41,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:41,981 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 103 transitions. [2024-10-11 01:34:41,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 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) [2024-10-11 01:34:41,981 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 103 transitions. [2024-10-11 01:34:41,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-10-11 01:34:41,983 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:41,983 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:41,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 01:34:41,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:41,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:41,984 INFO L85 PathProgramCache]: Analyzing trace with hash -136490662, now seen corresponding path program 1 times [2024-10-11 01:34:41,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:41,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567143449] [2024-10-11 01:34:41,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:41,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:42,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-10-11 01:34:42,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:42,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567143449] [2024-10-11 01:34:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567143449] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:42,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:42,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 01:34:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948122266] [2024-10-11 01:34:42,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 01:34:42,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:42,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 01:34:42,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 01:34:42,164 INFO L87 Difference]: Start difference. First operand 81 states and 103 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:34:42,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:42,315 INFO L93 Difference]: Finished difference Result 141 states and 174 transitions. [2024-10-11 01:34:42,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 01:34:42,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2024-10-11 01:34:42,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:42,317 INFO L225 Difference]: With dead ends: 141 [2024-10-11 01:34:42,317 INFO L226 Difference]: Without dead ends: 65 [2024-10-11 01:34:42,318 INFO L431 NwaCegarLoop]: 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 [2024-10-11 01:34:42,319 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 13 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:42,319 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 132 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:34:42,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-10-11 01:34:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2024-10-11 01:34:42,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 43 states have (on average 1.2325581395348837) internal successors, (53), 46 states have internal predecessors, (53), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2024-10-11 01:34:42,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2024-10-11 01:34:42,336 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 13 [2024-10-11 01:34:42,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:42,336 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2024-10-11 01:34:42,337 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-11 01:34:42,337 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2024-10-11 01:34:42,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 01:34:42,338 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:42,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 01:34:42,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 01:34:42,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:42,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:42,340 INFO L85 PathProgramCache]: Analyzing trace with hash 597783781, now seen corresponding path program 1 times [2024-10-11 01:34:42,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:42,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762962249] [2024-10-11 01:34:42,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:42,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:42,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:42,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:43,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:43,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:43,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762962249] [2024-10-11 01:34:43,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1762962249] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:43,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:43,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-11 01:34:43,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27271059] [2024-10-11 01:34:43,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:43,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 01:34:43,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:43,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 01:34:43,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-11 01:34:43,094 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 14 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:34:44,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:44,007 INFO L93 Difference]: Finished difference Result 157 states and 194 transitions. [2024-10-11 01:34:44,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2024-10-11 01:34:44,007 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 24 [2024-10-11 01:34:44,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:44,009 INFO L225 Difference]: With dead ends: 157 [2024-10-11 01:34:44,009 INFO L226 Difference]: Without dead ends: 135 [2024-10-11 01:34:44,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=120, Invalid=636, Unknown=0, NotChecked=0, Total=756 [2024-10-11 01:34:44,011 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 190 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 579 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:44,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 287 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 579 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 01:34:44,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-11 01:34:44,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 92. [2024-10-11 01:34:44,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 73 states have internal predecessors, (88), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 11 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 01:34:44,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 114 transitions. [2024-10-11 01:34:44,027 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 114 transitions. Word has length 24 [2024-10-11 01:34:44,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:44,027 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 114 transitions. [2024-10-11 01:34:44,028 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 1.8) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-11 01:34:44,028 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 114 transitions. [2024-10-11 01:34:44,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:34:44,030 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:44,030 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:34:44,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 01:34:44,031 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:44,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 1098099993, now seen corresponding path program 1 times [2024-10-11 01:34:44,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:44,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217413751] [2024-10-11 01:34:44,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:44,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:44,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:44,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:44,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:44,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:44,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:44,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:44,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:44,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:34:44,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:44,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 01:34:44,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:44,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217413751] [2024-10-11 01:34:44,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217413751] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 01:34:44,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 01:34:44,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 01:34:44,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241341633] [2024-10-11 01:34:44,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 01:34:44,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 01:34:44,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 01:34:44,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 01:34:44,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 01:34:44,176 INFO L87 Difference]: Start difference. First operand 92 states and 114 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 01:34:44,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 01:34:44,357 INFO L93 Difference]: Finished difference Result 102 states and 129 transitions. [2024-10-11 01:34:44,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 01:34:44,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 28 [2024-10-11 01:34:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 01:34:44,359 INFO L225 Difference]: With dead ends: 102 [2024-10-11 01:34:44,359 INFO L226 Difference]: Without dead ends: 100 [2024-10-11 01:34:44,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-10-11 01:34:44,360 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 23 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 01:34:44,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 160 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 01:34:44,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-10-11 01:34:44,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-10-11 01:34:44,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.2533333333333334) internal successors, (94), 79 states have internal predecessors, (94), 13 states have call successors, (13), 7 states have call predecessors, (13), 9 states have return successors, (19), 13 states have call predecessors, (19), 13 states have call successors, (19) [2024-10-11 01:34:44,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 126 transitions. [2024-10-11 01:34:44,382 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 126 transitions. Word has length 28 [2024-10-11 01:34:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 01:34:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 126 transitions. [2024-10-11 01:34:44,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 4 states have internal predecessors, (20), 1 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 01:34:44,383 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 126 transitions. [2024-10-11 01:34:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 01:34:44,385 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 01:34:44,385 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-10-11 01:34:44,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 01:34:44,388 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 01:34:44,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 01:34:44,389 INFO L85 PathProgramCache]: Analyzing trace with hash -1622263998, now seen corresponding path program 1 times [2024-10-11 01:34:44,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 01:34:44,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154840459] [2024-10-11 01:34:44,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:44,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 01:34:44,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 01:34:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 01:34:45,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-11 01:34:45,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-11 01:34:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 01:34:45,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 01:34:45,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1154840459] [2024-10-11 01:34:45,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1154840459] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 01:34:45,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1102037250] [2024-10-11 01:34:45,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 01:34:45,584 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 01:34:45,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 01:34:45,586 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 01:34:45,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 01:34:45,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 01:34:45,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-10-11 01:34:45,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 01:34:46,151 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 01:34:46,151 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-11 01:34:46,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:34:46,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2024-10-11 01:35:09,017 WARN L286 SmtUtils]: Spent 5.46s on a formula simplification. DAG size of input: 141 DAG size of output: 89 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2024-10-11 01:35:09,017 INFO L349 Elim1Store]: treesize reduction 626, result has 29.4 percent of original size [2024-10-11 01:35:09,018 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 11 case distinctions, treesize of input 742 treesize of output 697 [2024-10-11 01:35:09,233 INFO L224 Elim1Store]: Index analysis took 142 ms [2024-10-11 01:35:09,810 INFO L349 Elim1Store]: treesize reduction 966, result has 29.6 percent of original size [2024-10-11 01:35:09,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 626 treesize of output 625 [2024-10-11 01:35:11,997 INFO L349 Elim1Store]: treesize reduction 371, result has 21.4 percent of original size [2024-10-11 01:35:11,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 338 treesize of output 327 [2024-10-11 01:35:12,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:12,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 19 [2024-10-11 01:35:12,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:12,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2024-10-11 01:35:12,448 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:12,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 1 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 14 case distinctions, treesize of input 251 treesize of output 433 [2024-10-11 01:35:50,159 INFO L349 Elim1Store]: treesize reduction 161, result has 5.3 percent of original size [2024-10-11 01:35:50,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 1953 treesize of output 1656 [2024-10-11 01:35:50,205 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-10-11 01:35:50,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 1623 treesize of output 1394 [2024-10-11 01:35:50,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 7 [2024-10-11 01:35:55,885 INFO L349 Elim1Store]: treesize reduction 128, result has 21.0 percent of original size [2024-10-11 01:35:55,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 1133 treesize of output 882 [2024-10-11 01:35:56,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 01:35:56,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 55 [2024-10-11 01:35:56,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 01:35:56,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 779 treesize of output 687 [2024-10-11 01:35:56,591 INFO L349 Elim1Store]: treesize reduction 20, result has 59.2 percent of original size [2024-10-11 01:35:56,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 504 treesize of output 471 [2024-10-11 01:35:57,059 INFO L349 Elim1Store]: treesize reduction 8, result has 97.3 percent of original size [2024-10-11 01:35:57,060 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 2223 treesize of output 2078