./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 023d838f 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-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-09 21:59:26,490 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 21:59:26,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 21:59:26,555 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 21:59:26,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 21:59:26,576 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 21:59:26,576 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 21:59:26,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 21:59:26,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 21:59:26,578 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 21:59:26,579 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 21:59:26,580 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 21:59:26,580 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 21:59:26,580 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 21:59:26,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 21:59:26,582 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 21:59:26,582 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 21:59:26,582 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 21:59:26,583 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 21:59:26,583 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 21:59:26,585 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 21:59:26,586 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 21:59:26,587 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-09 21:59:26,587 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 21:59:26,587 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 21:59:26,587 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 21:59:26,587 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:26,587 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 21:59:26,588 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 21:59:26,589 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 21:59:26,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 21:59:26,594 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-09 21:59:26,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 21:59:26,824 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 21:59:26,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 21:59:26,827 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 21:59:26,827 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 21:59:26,828 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-09 21:59:28,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 21:59:28,378 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 21:59:28,379 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-1.i [2024-11-09 21:59:28,397 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f78631f/fd3c964ad7064e73bbda99407073b460/FLAG773adfe58 [2024-11-09 21:59:28,692 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f78631f/fd3c964ad7064e73bbda99407073b460 [2024-11-09 21:59:28,694 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 21:59:28,695 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 21:59:28,696 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:28,696 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 21:59:28,704 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 21:59:28,705 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:28" (1/1) ... [2024-11-09 21:59:28,706 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a42a95b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:28, skipping insertion in model container [2024-11-09 21:59:28,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 09:59:28" (1/1) ... [2024-11-09 21:59:28,747 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 21:59:29,018 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-09 21:59:29,024 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-09 21:59:29,026 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-09 21:59:29,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:29,041 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 21:59:29,096 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-09 21:59:29,096 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-09 21:59:29,097 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-09 21:59:29,105 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 21:59:29,134 INFO L204 MainTranslator]: Completed translation [2024-11-09 21:59:29,134 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29 WrapperNode [2024-11-09 21:59:29,135 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 21:59:29,136 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:29,136 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 21:59:29,136 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 21:59:29,142 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,195 INFO L138 Inliner]: procedures = 142, calls = 62, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 182 [2024-11-09 21:59:29,195 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 21:59:29,196 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 21:59:29,196 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 21:59:29,196 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 21:59:29,209 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,210 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,214 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,263 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-09 21:59:29,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,265 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,280 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,281 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,286 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 21:59:29,287 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-09 21:59:29,287 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-09 21:59:29,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-09 21:59:29,288 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (1/1) ... [2024-11-09 21:59:29,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 21:59:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:29,321 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-09 21:59:29,324 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-09 21:59:29,368 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-09 21:59:29,368 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-09 21:59:29,369 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-09 21:59:29,369 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-09 21:59:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 21:59:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 21:59:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 21:59:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 21:59:29,370 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-09 21:59:29,370 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 21:59:29,371 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 21:59:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 21:59:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-09 21:59:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-09 21:59:29,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 21:59:29,372 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 21:59:29,501 INFO L256 CfgBuilder]: Building ICFG [2024-11-09 21:59:29,503 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 21:59:29,677 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2024-11-09 21:59:29,677 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2024-11-09 21:59:29,733 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2024-11-09 21:59:29,733 INFO L307 CfgBuilder]: Performing block encoding [2024-11-09 21:59:29,744 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 21:59:29,745 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-09 21:59:29,745 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:29 BoogieIcfgContainer [2024-11-09 21:59:29,745 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-09 21:59:29,747 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 21:59:29,747 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 21:59:29,750 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 21:59:29,750 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 09:59:28" (1/3) ... [2024-11-09 21:59:29,750 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29195ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:29, skipping insertion in model container [2024-11-09 21:59:29,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 09:59:29" (2/3) ... [2024-11-09 21:59:29,751 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29195ca8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 09:59:29, skipping insertion in model container [2024-11-09 21:59:29,751 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 09.11 09:59:29" (3/3) ... [2024-11-09 21:59:29,752 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.i [2024-11-09 21:59:29,766 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 21:59:29,766 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-09 21:59:29,812 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 21:59:29,817 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;@49017ede, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 21:59:29,817 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-09 21:59:29,820 INFO L276 IsEmpty]: Start isEmpty. Operand has 78 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 65 states have internal predecessors, (82), 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-09 21:59:29,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-09 21:59:29,826 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:29,826 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:29,827 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:29,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:29,832 INFO L85 PathProgramCache]: Analyzing trace with hash -2005409863, now seen corresponding path program 1 times [2024-11-09 21:59:29,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:29,840 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604997984] [2024-11-09 21:59:29,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:29,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:29,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:29,959 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-09 21:59:29,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:29,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [604997984] [2024-11-09 21:59:29,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [604997984] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:29,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:29,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 21:59:29,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877102819] [2024-11-09 21:59:29,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:29,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 21:59:29,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:29,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 21:59:29,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 21:59:30,001 INFO L87 Difference]: Start difference. First operand has 78 states, 62 states have (on average 1.3225806451612903) internal successors, (82), 65 states have internal predecessors, (82), 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-09 21:59:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:30,046 INFO L93 Difference]: Finished difference Result 150 states and 195 transitions. [2024-11-09 21:59:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 21:59:30,048 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-09 21:59:30,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:30,053 INFO L225 Difference]: With dead ends: 150 [2024-11-09 21:59:30,053 INFO L226 Difference]: Without dead ends: 70 [2024-11-09 21:59:30,056 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-09 21:59:30,058 INFO L432 NwaCegarLoop]: 86 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, 86 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-09 21:59:30,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 21:59:30,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-11-09 21:59:30,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-11-09 21:59:30,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 57 states have internal predecessors, (65), 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-09 21:59:30,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 81 transitions. [2024-11-09 21:59:30,088 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 81 transitions. Word has length 13 [2024-11-09 21:59:30,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:30,089 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 81 transitions. [2024-11-09 21:59:30,089 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-09 21:59:30,089 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 81 transitions. [2024-11-09 21:59:30,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 21:59:30,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:30,090 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:30,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 21:59:30,091 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:30,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:30,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1804726777, now seen corresponding path program 1 times [2024-11-09 21:59:30,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:30,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367983610] [2024-11-09 21:59:30,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:30,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:30,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:30,418 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-09 21:59:30,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:30,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367983610] [2024-11-09 21:59:30,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367983610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:30,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:30,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 21:59:30,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717406434] [2024-11-09 21:59:30,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:30,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:59:30,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:30,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:59:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:30,422 INFO L87 Difference]: Start difference. First operand 70 states and 81 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-09 21:59:30,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:30,608 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2024-11-09 21:59:30,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 21:59:30,609 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 16 [2024-11-09 21:59:30,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:30,611 INFO L225 Difference]: With dead ends: 127 [2024-11-09 21:59:30,611 INFO L226 Difference]: Without dead ends: 121 [2024-11-09 21:59:30,612 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-09 21:59:30,613 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 54 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 295 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-09 21:59:30,613 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 295 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:30,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-09 21:59:30,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 104. [2024-11-09 21:59:30,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.223529411764706) internal successors, (104), 87 states have internal predecessors, (104), 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-09 21:59:30,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2024-11-09 21:59:30,624 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 16 [2024-11-09 21:59:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:30,625 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2024-11-09 21:59:30,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-09 21:59:30,625 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2024-11-09 21:59:30,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 21:59:30,626 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:30,626 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:30,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 21:59:30,626 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:30,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash 751963975, now seen corresponding path program 1 times [2024-11-09 21:59:30,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:30,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341871383] [2024-11-09 21:59:30,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:30,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:30,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 21:59:30,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:30,703 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-09 21:59:30,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:30,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341871383] [2024-11-09 21:59:30,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341871383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:30,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:30,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 21:59:30,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615109292] [2024-11-09 21:59:30,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:30,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 21:59:30,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:30,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 21:59:30,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 21:59:30,709 INFO L87 Difference]: Start difference. First operand 104 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 21:59:30,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:30,821 INFO L93 Difference]: Finished difference Result 180 states and 213 transitions. [2024-11-09 21:59:30,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 21:59:30,821 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 18 [2024-11-09 21:59:30,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:30,822 INFO L225 Difference]: With dead ends: 180 [2024-11-09 21:59:30,822 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 21:59:30,823 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-11-09 21:59:30,823 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 17 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 195 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-09 21:59:30,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 195 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:30,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 21:59:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-09 21:59:30,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 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-09 21:59:30,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 89 transitions. [2024-11-09 21:59:30,841 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 89 transitions. Word has length 18 [2024-11-09 21:59:30,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:30,841 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 89 transitions. [2024-11-09 21:59:30,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 21:59:30,842 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 89 transitions. [2024-11-09 21:59:30,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 21:59:30,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:30,844 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:30,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 21:59:30,844 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:30,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:30,846 INFO L85 PathProgramCache]: Analyzing trace with hash -853023350, now seen corresponding path program 1 times [2024-11-09 21:59:30,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:30,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142560997] [2024-11-09 21:59:30,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:30,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:31,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:31,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:31,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,422 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:31,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142560997] [2024-11-09 21:59:31,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [142560997] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 21:59:31,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1219734337] [2024-11-09 21:59:31,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:31,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 21:59:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 21:59:31,425 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-09 21:59:31,428 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-09 21:59:31,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:31,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-09 21:59:31,552 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 21:59:31,734 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 21:59:31,735 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-09 21:59:31,850 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-09 21:59:31,871 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-09 21:59:31,872 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-09 21:59:31,913 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-09 21:59:31,933 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2024-11-09 21:59:31,933 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-09 21:59:31,971 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-09 21:59:31,985 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-09 21:59:32,008 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-09 21:59:32,021 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-09 21:59:32,049 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-09 21:59:32,057 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-09 21:59:32,065 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-09 21:59:32,069 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-09 21:59:32,081 INFO L349 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2024-11-09 21:59:32,081 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-09 21:59:32,093 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-09 21:59:32,100 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-09 21:59:33,145 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-09 21:59:33,150 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-09 21:59:33,154 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-09 21:59:33,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:33,160 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-09 21:59:33,163 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-09 21:59:33,172 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-09 21:59:33,199 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:33,199 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 21:59:33,469 INFO L349 Elim1Store]: treesize reduction 136, result has 36.7 percent of original size [2024-11-09 21:59:33,470 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-09 21:59:33,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:33,526 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-09 21:59:33,540 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-09 21:59:33,551 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-09 21:59:33,702 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-09 21:59:33,727 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-09 21:59:33,775 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-09 21:59:33,792 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-09 21:59:33,817 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-09 21:59:33,818 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-09 21:59:33,857 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-09 21:59:33,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 21:59:33,898 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-09 21:59:34,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 21:59:34,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 21:59:34,199 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-09 21:59:34,200 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-09 21:59:34,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 21:59:34,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1219734337] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 21:59:34,323 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 21:59:34,323 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-09 21:59:34,323 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848457047] [2024-11-09 21:59:34,323 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 21:59:34,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 21:59:34,324 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:34,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 21:59:34,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-09 21:59:34,325 INFO L87 Difference]: Start difference. First operand 78 states and 89 transitions. Second operand has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 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-09 21:59:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:36,515 INFO L93 Difference]: Finished difference Result 233 states and 274 transitions. [2024-11-09 21:59:36,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-09 21:59:36,516 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 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 35 [2024-11-09 21:59:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:36,517 INFO L225 Difference]: With dead ends: 233 [2024-11-09 21:59:36,517 INFO L226 Difference]: Without dead ends: 203 [2024-11-09 21:59:36,518 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 495 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=354, Invalid=2384, Unknown=18, NotChecked=0, Total=2756 [2024-11-09 21:59:36,519 INFO L432 NwaCegarLoop]: 43 mSDtfsCounter, 794 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 1212 mSolverCounterSat, 212 mSolverCounterUnsat, 93 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 1517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 1212 IncrementalHoareTripleChecker+Invalid, 93 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-09 21:59:36,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 795 Invalid, 1517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 1212 Invalid, 93 Unknown, 0 Unchecked, 1.4s Time] [2024-11-09 21:59:36,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-09 21:59:36,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 138. [2024-11-09 21:59:36,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 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), 8 states have return successors, (14), 12 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 21:59:36,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 166 transitions. [2024-11-09 21:59:36,540 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 166 transitions. Word has length 35 [2024-11-09 21:59:36,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:36,540 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 166 transitions. [2024-11-09 21:59:36,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 27 states have (on average 2.185185185185185) internal successors, (59), 24 states have internal predecessors, (59), 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-09 21:59:36,541 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 166 transitions. [2024-11-09 21:59:36,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 21:59:36,541 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:36,541 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:36,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 21:59:36,745 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-09 21:59:36,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:36,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:36,746 INFO L85 PathProgramCache]: Analyzing trace with hash -2135334248, now seen corresponding path program 1 times [2024-11-09 21:59:36,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:36,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725660607] [2024-11-09 21:59:36,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:36,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:36,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-09 21:59:36,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:36,842 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 21:59:36,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 21:59:36,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725660607] [2024-11-09 21:59:36,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725660607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 21:59:36,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 21:59:36,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 21:59:36,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [144693022] [2024-11-09 21:59:36,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 21:59:36,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 21:59:36,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 21:59:36,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 21:59:36,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 21:59:36,846 INFO L87 Difference]: Start difference. First operand 138 states and 166 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 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-09 21:59:36,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 21:59:36,977 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2024-11-09 21:59:36,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 21:59:36,978 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 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 37 [2024-11-09 21:59:36,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 21:59:36,979 INFO L225 Difference]: With dead ends: 150 [2024-11-09 21:59:36,979 INFO L226 Difference]: Without dead ends: 148 [2024-11-09 21:59:36,979 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-09 21:59:36,980 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 28 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 242 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-09 21:59:36,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 242 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 21:59:36,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-09 21:59:36,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2024-11-09 21:59:37,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 119 states have (on average 1.2100840336134453) internal successors, (144), 123 states have internal predecessors, (144), 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-09 21:59:37,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 178 transitions. [2024-11-09 21:59:37,001 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 178 transitions. Word has length 37 [2024-11-09 21:59:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 21:59:37,003 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 178 transitions. [2024-11-09 21:59:37,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 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-09 21:59:37,003 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 178 transitions. [2024-11-09 21:59:37,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 21:59:37,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 21:59:37,004 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 21:59:37,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 21:59:37,005 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 21:59:37,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 21:59:37,005 INFO L85 PathProgramCache]: Analyzing trace with hash -303068584, now seen corresponding path program 1 times [2024-11-09 21:59:37,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 21:59:37,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665750465] [2024-11-09 21:59:37,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 21:59:37,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 21:59:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 21:59:37,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:37,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-09 21:59:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 21:59:38,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-09 21:59:38,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat