./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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-?-c7c6ca5-m [2024-11-08 13:49:15,548 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 13:49:15,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 13:49:15,645 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 13:49:15,645 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 13:49:15,685 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 13:49:15,686 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 13:49:15,686 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 13:49:15,686 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 13:49:15,687 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 13:49:15,687 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 13:49:15,693 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 13:49:15,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 13:49:15,696 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 13:49:15,696 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 13:49:15,697 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 13:49:15,697 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 13:49:15,697 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 13:49:15,697 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 13:49:15,697 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 13:49:15,697 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 13:49:15,700 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 13:49:15,700 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 13:49:15,700 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 13:49:15,700 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 13:49:15,701 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 13:49:15,701 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 13:49:15,701 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 13:49:15,701 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 13:49:15,701 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 13:49:15,702 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 13:49:15,702 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:15,703 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 13:49:15,703 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 13:49:15,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 13:49:15,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 13:49:15,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 13:49:15,705 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/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/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-11-08 13:49:15,924 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 13:49:15,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 13:49:15,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 13:49:15,949 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 13:49:15,949 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 13:49:15,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-11-08 13:49:17,294 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 13:49:17,538 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 13:49:17,539 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-11-08 13:49:17,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37678757a/d9f272e8e5574079a5c3bfffcdf878ba/FLAGe06da7c80 [2024-11-08 13:49:17,570 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/37678757a/d9f272e8e5574079a5c3bfffcdf878ba [2024-11-08 13:49:17,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 13:49:17,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 13:49:17,577 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:17,577 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 13:49:17,582 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 13:49:17,583 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:17" (1/1) ... [2024-11-08 13:49:17,583 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13fdbe42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:17, skipping insertion in model container [2024-11-08 13:49:17,584 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 01:49:17" (1/1) ... [2024-11-08 13:49:17,622 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 13:49:18,034 WARN L250 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-11-08 13:49:18,040 WARN L250 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-11-08 13:49:18,042 WARN L250 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-11-08 13:49:18,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:18,063 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 13:49:18,109 WARN L250 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-11-08 13:49:18,110 WARN L250 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-11-08 13:49:18,114 WARN L250 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-11-08 13:49:18,122 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 13:49:18,152 INFO L204 MainTranslator]: Completed translation [2024-11-08 13:49:18,153 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18 WrapperNode [2024-11-08 13:49:18,153 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 13:49:18,154 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:18,155 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 13:49:18,155 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 13:49:18,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,174 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,199 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 186 [2024-11-08 13:49:18,199 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 13:49:18,200 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 13:49:18,200 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 13:49:18,200 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 13:49:18,210 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,220 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,245 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-11-08 13:49:18,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,245 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,263 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,264 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,271 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 13:49:18,272 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 13:49:18,272 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 13:49:18,272 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 13:49:18,272 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (1/1) ... [2024-11-08 13:49:18,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 13:49:18,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:18,299 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-08 13:49:18,305 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-08 13:49:18,337 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-08 13:49:18,337 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-08 13:49:18,338 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-08 13:49:18,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-08 13:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-08 13:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 13:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-08 13:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-08 13:49:18,339 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-08 13:49:18,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-08 13:49:18,340 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 13:49:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-08 13:49:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-08 13:49:18,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-08 13:49:18,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 13:49:18,341 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 13:49:18,466 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 13:49:18,468 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 13:49:18,688 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-08 13:49:18,688 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 13:49:18,698 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 13:49:18,698 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-08 13:49:18,699 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:18 BoogieIcfgContainer [2024-11-08 13:49:18,699 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 13:49:18,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 13:49:18,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 13:49:18,703 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 13:49:18,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 01:49:17" (1/3) ... [2024-11-08 13:49:18,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219679a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:18, skipping insertion in model container [2024-11-08 13:49:18,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 01:49:18" (2/3) ... [2024-11-08 13:49:18,704 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219679a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 01:49:18, skipping insertion in model container [2024-11-08 13:49:18,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 01:49:18" (3/3) ... [2024-11-08 13:49:18,705 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2024-11-08 13:49:18,719 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 13:49:18,719 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-08 13:49:18,766 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 13:49:18,771 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;@118949d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 13:49:18,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-08 13:49:18,775 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 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-11-08 13:49:18,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 13:49:18,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:18,782 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:18,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:18,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:18,787 INFO L85 PathProgramCache]: Analyzing trace with hash 808308259, now seen corresponding path program 1 times [2024-11-08 13:49:18,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:18,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543287461] [2024-11-08 13:49:18,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:18,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:18,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:18,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:18,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:18,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543287461] [2024-11-08 13:49:18,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543287461] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:18,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:18,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 13:49:18,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [754084298] [2024-11-08 13:49:18,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:18,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 13:49:18,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:18,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 13:49:18,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 13:49:18,962 INFO L87 Difference]: Start difference. First operand has 74 states, 58 states have (on average 1.3448275862068966) internal successors, (78), 61 states have internal predecessors, (78), 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 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11-08 13:49:18,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:18,982 INFO L93 Difference]: Finished difference Result 145 states and 190 transitions. [2024-11-08 13:49:18,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 13:49:18,983 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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 13 [2024-11-08 13:49:18,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:18,989 INFO L225 Difference]: With dead ends: 145 [2024-11-08 13:49:18,989 INFO L226 Difference]: Without dead ends: 69 [2024-11-08 13:49:18,992 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-11-08 13:49:18,995 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:18,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 13:49:19,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2024-11-08 13:49:19,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2024-11-08 13:49:19,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 56 states have internal predecessors, (64), 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-11-08 13:49:19,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 80 transitions. [2024-11-08 13:49:19,029 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 80 transitions. Word has length 13 [2024-11-08 13:49:19,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:19,029 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 80 transitions. [2024-11-08 13:49:19,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 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-11-08 13:49:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 80 transitions. [2024-11-08 13:49:19,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-08 13:49:19,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:19,031 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:19,031 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 13:49:19,031 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:19,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1521523987, now seen corresponding path program 1 times [2024-11-08 13:49:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:19,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792688147] [2024-11-08 13:49:19,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:19,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:19,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:19,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792688147] [2024-11-08 13:49:19,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792688147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:19,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:19,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 13:49:19,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550591728] [2024-11-08 13:49:19,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:19,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:49:19,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:19,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:49:19,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:49:19,341 INFO L87 Difference]: Start difference. First operand 69 states and 80 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-11-08 13:49:19,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:19,534 INFO L93 Difference]: Finished difference Result 124 states and 147 transitions. [2024-11-08 13:49:19,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-08 13:49:19,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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 13 [2024-11-08 13:49:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:19,536 INFO L225 Difference]: With dead ends: 124 [2024-11-08 13:49:19,536 INFO L226 Difference]: Without dead ends: 118 [2024-11-08 13:49:19,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 13:49:19,539 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 55 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:19,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 290 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-11-08 13:49:19,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 101. [2024-11-08 13:49:19,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 82 states have (on average 1.2317073170731707) internal successors, (101), 84 states have internal predecessors, (101), 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-11-08 13:49:19,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-11-08 13:49:19,556 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 13 [2024-11-08 13:49:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-11-08 13:49:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 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-11-08 13:49:19,557 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-11-08 13:49:19,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-08 13:49:19,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:19,557 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:19,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 13:49:19,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:19,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:19,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1971943109, now seen corresponding path program 1 times [2024-11-08 13:49:19,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:19,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739007971] [2024-11-08 13:49:19,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:19,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:19,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:19,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-08 13:49:19,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:19,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:19,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739007971] [2024-11-08 13:49:19,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739007971] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:19,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:19,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 13:49:19,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466172058] [2024-11-08 13:49:19,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:19,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 13:49:19,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:19,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 13:49:19,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 13:49:19,662 INFO L87 Difference]: Start difference. First operand 101 states and 123 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-08 13:49:19,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:19,812 INFO L93 Difference]: Finished difference Result 174 states and 207 transitions. [2024-11-08 13:49:19,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 13:49:19,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2024-11-08 13:49:19,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:19,813 INFO L225 Difference]: With dead ends: 174 [2024-11-08 13:49:19,813 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 13:49:19,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-08 13:49:19,818 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 14 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:19,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 192 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:19,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 13:49:19,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2024-11-08 13:49:19,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 59 states have (on average 1.1694915254237288) internal successors, (69), 62 states have internal predecessors, (69), 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-11-08 13:49:19,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 87 transitions. [2024-11-08 13:49:19,825 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 87 transitions. Word has length 15 [2024-11-08 13:49:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:19,825 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 87 transitions. [2024-11-08 13:49:19,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 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-11-08 13:49:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 87 transitions. [2024-11-08 13:49:19,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-08 13:49:19,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:19,827 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, 1, 1, 1, 1] [2024-11-08 13:49:19,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 13:49:19,827 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:19,827 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:19,827 INFO L85 PathProgramCache]: Analyzing trace with hash 1127828892, now seen corresponding path program 1 times [2024-11-08 13:49:19,827 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:19,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715670873] [2024-11-08 13:49:19,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:19,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:20,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:49:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:20,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:49:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:20,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:49:20,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:20,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:20,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715670873] [2024-11-08 13:49:20,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715670873] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 13:49:20,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [248241469] [2024-11-08 13:49:20,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:20,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:20,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 13:49:20,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-08 13:49:20,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-08 13:49:20,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:20,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-08 13:49:20,570 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 13:49:20,726 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-08 13:49:20,727 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 11 treesize of output 11 [2024-11-08 13:49:20,836 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 42 [2024-11-08 13:49:20,857 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-08 13:49:20,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 30 [2024-11-08 13:49:20,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 42 [2024-11-08 13:49:20,908 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-08 13:49:20,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 26 [2024-11-08 13:49:20,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-08 13:49:20,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 54 [2024-11-08 13:49:20,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 52 [2024-11-08 13:49:20,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 74 [2024-11-08 13:49:20,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 47 [2024-11-08 13:49:20,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 50 [2024-11-08 13:49:20,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2024-11-08 13:49:20,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 27 [2024-11-08 13:49:21,002 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-08 13:49:21,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2024-11-08 13:49:21,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 42 [2024-11-08 13:49:21,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 37 [2024-11-08 13:49:21,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1386 treesize of output 1302 [2024-11-08 13:49:21,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 58 [2024-11-08 13:49:21,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 61 [2024-11-08 13:49:21,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:21,944 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 59 treesize of output 51 [2024-11-08 13:49:21,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 54 [2024-11-08 13:49:21,955 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-08 13:49:21,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:21,984 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 13:49:22,270 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2024-11-08 13:49:22,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 1118 treesize of output 653 [2024-11-08 13:49:22,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:22,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 251 treesize of output 267 [2024-11-08 13:49:22,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 144 treesize of output 142 [2024-11-08 13:49:22,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 138 [2024-11-08 13:49:22,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-08 13:49:22,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:49:22,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:49:22,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-11-08 13:49:22,653 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-08 13:49:22,653 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 29 treesize of output 28 [2024-11-08 13:49:22,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-08 13:49:22,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-08 13:49:22,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 121 treesize of output 179 [2024-11-08 13:49:23,051 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-08 13:49:23,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-08 13:49:23,061 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-08 13:49:23,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 1 [2024-11-08 13:49:23,189 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-08 13:49:23,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [248241469] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 13:49:23,190 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 13:49:23,190 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-08 13:49:23,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768276037] [2024-11-08 13:49:23,190 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 13:49:23,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-08 13:49:23,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:23,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-08 13:49:23,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-08 13:49:23,192 INFO L87 Difference]: Start difference. First operand 76 states and 87 transitions. Second operand has 32 states, 27 states have (on average 2.0) internal successors, (54), 24 states have internal predecessors, (54), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 13:49:25,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:25,173 INFO L93 Difference]: Finished difference Result 228 states and 269 transitions. [2024-11-08 13:49:25,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-08 13:49:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.0) internal successors, (54), 24 states have internal predecessors, (54), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 32 [2024-11-08 13:49:25,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:25,175 INFO L225 Difference]: With dead ends: 228 [2024-11-08 13:49:25,175 INFO L226 Difference]: Without dead ends: 199 [2024-11-08 13:49:25,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=354, Invalid=2384, Unknown=18, NotChecked=0, Total=2756 [2024-11-08 13:49:25,177 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 542 mSDsluCounter, 709 mSDsCounter, 0 mSdLazyCounter, 1203 mSolverCounterSat, 157 mSolverCounterUnsat, 99 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 750 SdHoareTripleChecker+Invalid, 1459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1203 IncrementalHoareTripleChecker+Invalid, 99 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:25,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 750 Invalid, 1459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1203 Invalid, 99 Unknown, 0 Unchecked, 1.3s Time] [2024-11-08 13:49:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2024-11-08 13:49:25,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 132. [2024-11-08 13:49:25,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 107 states have (on average 1.233644859813084) internal successors, (132), 111 states have internal predecessors, (132), 14 states have call successors, (14), 8 states have call predecessors, (14), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-08 13:49:25,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 160 transitions. [2024-11-08 13:49:25,190 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 160 transitions. Word has length 32 [2024-11-08 13:49:25,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:25,190 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 160 transitions. [2024-11-08 13:49:25,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.0) internal successors, (54), 24 states have internal predecessors, (54), 7 states have call successors, (9), 6 states have call predecessors, (9), 9 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2024-11-08 13:49:25,191 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 160 transitions. [2024-11-08 13:49:25,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:49:25,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:25,191 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, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:25,205 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-08 13:49:25,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 13:49:25,396 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:25,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:25,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1084453300, now seen corresponding path program 1 times [2024-11-08 13:49:25,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:25,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906747621] [2024-11-08 13:49:25,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:25,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:25,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:49:25,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:49:25,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:49:25,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-08 13:49:25,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-08 13:49:25,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 13:49:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906747621] [2024-11-08 13:49:25,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906747621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 13:49:25,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 13:49:25,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 13:49:25,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098350618] [2024-11-08 13:49:25,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 13:49:25,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 13:49:25,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 13:49:25,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 13:49:25,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-08 13:49:25,485 INFO L87 Difference]: Start difference. First operand 132 states and 160 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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-11-08 13:49:25,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 13:49:25,628 INFO L93 Difference]: Finished difference Result 144 states and 177 transitions. [2024-11-08 13:49:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 13:49:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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 34 [2024-11-08 13:49:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 13:49:25,630 INFO L225 Difference]: With dead ends: 144 [2024-11-08 13:49:25,630 INFO L226 Difference]: Without dead ends: 142 [2024-11-08 13:49:25,630 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-11-08 13:49:25,631 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 28 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 13:49:25,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 237 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 13:49:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-08 13:49:25,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2024-11-08 13:49:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 113 states have (on average 1.2212389380530972) internal successors, (138), 117 states have internal predecessors, (138), 14 states have call successors, (14), 8 states have call predecessors, (14), 10 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2024-11-08 13:49:25,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 172 transitions. [2024-11-08 13:49:25,649 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 172 transitions. Word has length 34 [2024-11-08 13:49:25,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 13:49:25,649 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 172 transitions. [2024-11-08 13:49:25,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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-11-08 13:49:25,649 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 172 transitions. [2024-11-08 13:49:25,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-08 13:49:25,650 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 13:49:25,650 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, 1, 1, 1, 1, 1, 1] [2024-11-08 13:49:25,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 13:49:25,650 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 13:49:25,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 13:49:25,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1635910691, now seen corresponding path program 1 times [2024-11-08 13:49:25,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 13:49:25,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351452388] [2024-11-08 13:49:25,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 13:49:25,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 13:49:25,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:25,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-08 13:49:25,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:26,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-08 13:49:26,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 13:49:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-08 13:49:26,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat