./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.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 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 20:41:08,649 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 20:41:08,790 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 20:41:08,794 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 20:41:08,795 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 20:41:08,815 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 20:41:08,815 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 20:41:08,816 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 20:41:08,816 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 20:41:08,817 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 20:41:08,817 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 20:41:08,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 20:41:08,818 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 20:41:08,819 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 20:41:08,819 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 20:41:08,820 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 20:41:08,820 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 20:41:08,820 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 20:41:08,821 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 20:41:08,821 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 20:41:08,821 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 20:41:08,824 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 20:41:08,825 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 20:41:08,825 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 20:41:08,825 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 20:41:08,826 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 20:41:08,826 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 20:41:08,826 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 20:41:08,826 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 20:41:08,827 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 20:41:08,827 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 20:41:08,827 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 20:41:08,827 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:41:08,828 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 20:41:08,828 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 20:41:08,828 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 20:41:08,829 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 20:41:08,829 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 20:41:08,830 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 20:41:08,830 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 20:41:08,830 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 20:41:08,831 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 20:41:08,831 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 -> 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f [2024-11-19 20:41:09,092 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 20:41:09,120 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 20:41:09,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 20:41:09,125 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 20:41:09,125 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 20:41:09,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-11-19 20:41:10,589 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 20:41:10,851 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 20:41:10,854 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2024-11-19 20:41:10,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a47216a/a3dbc3a52fd842a597fb7c45d83236f4/FLAG180eebd19 [2024-11-19 20:41:10,896 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/07a47216a/a3dbc3a52fd842a597fb7c45d83236f4 [2024-11-19 20:41:10,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 20:41:10,902 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 20:41:10,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 20:41:10,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 20:41:10,910 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 20:41:10,911 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:41:10" (1/1) ... [2024-11-19 20:41:10,914 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76a31026 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:10, skipping insertion in model container [2024-11-19 20:41:10,914 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:41:10" (1/1) ... [2024-11-19 20:41:10,957 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 20:41:11,319 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-2.i[26271,26284] [2024-11-19 20:41:11,326 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-2.i[26396,26409] [2024-11-19 20:41:11,330 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-2.i[26511,26524] [2024-11-19 20:41:11,342 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:41:11,352 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 20:41:11,405 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-2.i[26271,26284] [2024-11-19 20:41:11,406 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-2.i[26396,26409] [2024-11-19 20:41:11,407 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-2.i[26511,26524] [2024-11-19 20:41:11,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 20:41:11,447 INFO L204 MainTranslator]: Completed translation [2024-11-19 20:41:11,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11 WrapperNode [2024-11-19 20:41:11,448 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 20:41:11,449 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 20:41:11,449 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 20:41:11,449 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 20:41:11,456 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,475 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,512 INFO L138 Inliner]: procedures = 142, calls = 63, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 187 [2024-11-19 20:41:11,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 20:41:11,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 20:41:11,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 20:41:11,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 20:41:11,527 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,534 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,573 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-19 20:41:11,574 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,574 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,586 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,592 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,595 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,597 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,600 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 20:41:11,601 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 20:41:11,601 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 20:41:11,602 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 20:41:11,602 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (1/1) ... [2024-11-19 20:41:11,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 20:41:11,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:41:11,649 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-19 20:41:11,659 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-19 20:41:11,716 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2024-11-19 20:41:11,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2024-11-19 20:41:11,718 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2024-11-19 20:41:11,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2024-11-19 20:41:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 20:41:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 20:41:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 20:41:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 20:41:11,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2024-11-19 20:41:11,720 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2024-11-19 20:41:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 20:41:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 20:41:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 20:41:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 20:41:11,720 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 20:41:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2024-11-19 20:41:11,721 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2024-11-19 20:41:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 20:41:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 20:41:11,721 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2024-11-19 20:41:11,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2024-11-19 20:41:11,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 20:41:11,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 20:41:11,915 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 20:41:11,917 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 20:41:12,261 INFO L? ?]: Removed 72 outVars from TransFormulas that were not future-live. [2024-11-19 20:41:12,261 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 20:41:12,279 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 20:41:12,279 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-19 20:41:12,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:41:12 BoogieIcfgContainer [2024-11-19 20:41:12,280 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 20:41:12,281 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 20:41:12,281 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 20:41:12,284 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 20:41:12,284 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:41:10" (1/3) ... [2024-11-19 20:41:12,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513e1768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:41:12, skipping insertion in model container [2024-11-19 20:41:12,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:41:11" (2/3) ... [2024-11-19 20:41:12,285 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@513e1768 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:41:12, skipping insertion in model container [2024-11-19 20:41:12,285 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:41:12" (3/3) ... [2024-11-19 20:41:12,286 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2024-11-19 20:41:12,300 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 20:41:12,300 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2024-11-19 20:41:12,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 20:41:12,362 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;@1c6afec6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 20:41:12,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2024-11-19 20:41:12,367 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 63 states have internal predecessors, (80), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 20:41:12,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 20:41:12,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:12,374 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:41:12,374 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:12,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:12,378 INFO L85 PathProgramCache]: Analyzing trace with hash -674549539, now seen corresponding path program 1 times [2024-11-19 20:41:12,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:12,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52760743] [2024-11-19 20:41:12,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:12,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:12,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:12,550 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-19 20:41:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:41:12,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52760743] [2024-11-19 20:41:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52760743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:41:12,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:41:12,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 20:41:12,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664537592] [2024-11-19 20:41:12,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:41:12,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 20:41:12,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:41:12,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 20:41:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 20:41:12,577 INFO L87 Difference]: Start difference. First operand has 79 states, 60 states have (on average 1.3333333333333333) internal successors, (80), 63 states have internal predecessors, (80), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) 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-19 20:41:12,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:41:12,601 INFO L93 Difference]: Finished difference Result 155 states and 202 transitions. [2024-11-19 20:41:12,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 20:41:12,605 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-19 20:41:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:41:12,612 INFO L225 Difference]: With dead ends: 155 [2024-11-19 20:41:12,613 INFO L226 Difference]: Without dead ends: 74 [2024-11-19 20:41:12,616 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-19 20:41:12,619 INFO L432 NwaCegarLoop]: 91 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, 91 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-19 20:41:12,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 20:41:12,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-19 20:41:12,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2024-11-19 20:41:12,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 56 states have (on average 1.1785714285714286) internal successors, (66), 58 states have internal predecessors, (66), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-19 20:41:12,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 86 transitions. [2024-11-19 20:41:12,657 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 86 transitions. Word has length 13 [2024-11-19 20:41:12,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:41:12,657 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 86 transitions. [2024-11-19 20:41:12,658 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-19 20:41:12,658 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 86 transitions. [2024-11-19 20:41:12,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-19 20:41:12,660 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:12,660 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:41:12,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 20:41:12,660 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:12,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:12,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1532746736, now seen corresponding path program 1 times [2024-11-19 20:41:12,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:12,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181693158] [2024-11-19 20:41:12,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:12,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:12,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:13,097 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-19 20:41:13,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:41:13,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181693158] [2024-11-19 20:41:13,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181693158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:41:13,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:41:13,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 20:41:13,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006398144] [2024-11-19 20:41:13,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:41:13,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:41:13,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:41:13,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:41:13,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:41:13,104 INFO L87 Difference]: Start difference. First operand 74 states and 86 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-19 20:41:13,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:41:13,378 INFO L93 Difference]: Finished difference Result 131 states and 157 transitions. [2024-11-19 20:41:13,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 20:41:13,379 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-19 20:41:13,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:41:13,382 INFO L225 Difference]: With dead ends: 131 [2024-11-19 20:41:13,382 INFO L226 Difference]: Without dead ends: 125 [2024-11-19 20:41:13,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 20:41:13,383 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 57 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:41:13,384 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 327 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:41:13,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-19 20:41:13,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 101. [2024-11-19 20:41:13,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 79 states have (on average 1.2278481012658229) internal successors, (97), 82 states have internal predecessors, (97), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-19 20:41:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 123 transitions. [2024-11-19 20:41:13,412 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 123 transitions. Word has length 13 [2024-11-19 20:41:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:41:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 123 transitions. [2024-11-19 20:41:13,412 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-19 20:41:13,412 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 123 transitions. [2024-11-19 20:41:13,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-19 20:41:13,413 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:13,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 20:41:13,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 20:41:13,414 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:13,416 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:13,416 INFO L85 PathProgramCache]: Analyzing trace with hash -93894743, now seen corresponding path program 1 times [2024-11-19 20:41:13,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:13,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436009278] [2024-11-19 20:41:13,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:13,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:13,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:13,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 20:41:13,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:13,528 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-19 20:41:13,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:41:13,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436009278] [2024-11-19 20:41:13,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436009278] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:41:13,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:41:13,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 20:41:13,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13241105] [2024-11-19 20:41:13,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:41:13,529 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 20:41:13,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:41:13,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 20:41:13,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 20:41:13,531 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-19 20:41:13,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:41:13,669 INFO L93 Difference]: Finished difference Result 177 states and 210 transitions. [2024-11-19 20:41:13,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 20:41:13,670 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-19 20:41:13,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:41:13,671 INFO L225 Difference]: With dead ends: 177 [2024-11-19 20:41:13,671 INFO L226 Difference]: Without dead ends: 86 [2024-11-19 20:41:13,672 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-19 20:41:13,673 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 210 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-19 20:41:13,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 210 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 20:41:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-11-19 20:41:13,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 81. [2024-11-19 20:41:13,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 61 states have (on average 1.1639344262295082) internal successors, (71), 64 states have internal predecessors, (71), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-19 20:41:13,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2024-11-19 20:41:13,691 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 15 [2024-11-19 20:41:13,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:41:13,692 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2024-11-19 20:41:13,692 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-19 20:41:13,694 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2024-11-19 20:41:13,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-19 20:41:13,695 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:13,695 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-19 20:41:13,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 20:41:13,695 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:13,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:13,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1319119747, now seen corresponding path program 1 times [2024-11-19 20:41:13,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:13,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661226352] [2024-11-19 20:41:13,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:13,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:14,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:41:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:14,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 20:41:14,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:14,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:41:14,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:14,468 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-19 20:41:14,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:41:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661226352] [2024-11-19 20:41:14,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661226352] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 20:41:14,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [150564646] [2024-11-19 20:41:14,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:14,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 20:41:14,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 20:41:14,474 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-19 20:41:14,478 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-19 20:41:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:14,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 20:41:14,621 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 20:41:14,813 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 20:41:14,814 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-19 20:41:14,959 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-19 20:41:14,991 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2024-11-19 20:41:14,992 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 28 treesize of output 18 [2024-11-19 20:41:14,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 42 treesize of output 25 [2024-11-19 20:41:15,021 INFO L349 Elim1Store]: treesize reduction 17, result has 46.9 percent of original size [2024-11-19 20:41:15,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 35 [2024-11-19 20:41:15,046 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-19 20:41:15,159 INFO L349 Elim1Store]: treesize reduction 44, result has 29.0 percent of original size [2024-11-19 20:41:15,159 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 28 treesize of output 18 [2024-11-19 20:41:15,178 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 42 treesize of output 25 [2024-11-19 20:41:15,188 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 7 treesize of output 3 [2024-11-19 20:41:15,199 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 8 treesize of output 7 [2024-11-19 20:41:15,236 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-19 20:41:15,258 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 39 treesize of output 37 [2024-11-19 20:41:15,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 2 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-19 20:41:15,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 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-19 20:41:15,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 34 [2024-11-19 20:41:15,311 INFO L349 Elim1Store]: treesize reduction 31, result has 3.1 percent of original size [2024-11-19 20:41:15,312 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 0 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 1 [2024-11-19 20:41:15,324 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-19 20:41:15,348 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 62 treesize of output 54 [2024-11-19 20:41:15,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 4 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-19 20:41:15,411 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-19 20:41:15,602 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 16 treesize of output 8 [2024-11-19 20:41:15,631 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-19 20:41:15,631 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 20:41:16,162 INFO L349 Elim1Store]: treesize reduction 125, result has 41.9 percent of original size [2024-11-19 20:41:16,163 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 554 treesize of output 372 [2024-11-19 20:41:16,196 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 136 treesize of output 132 [2024-11-19 20:41:16,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 20:41:16,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 204 treesize of output 216 [2024-11-19 20:41:16,233 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 124 treesize of output 122 [2024-11-19 20:41:16,443 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-19 20:41:16,457 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 13 treesize of output 9 [2024-11-19 20:41:16,469 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-19 20:41:16,570 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 20:41:16,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 20:41:16,582 INFO L349 Elim1Store]: treesize reduction 94, result has 1.1 percent of original size [2024-11-19 20:41:16,582 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-19 20:41:16,729 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-19 20:41:16,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [150564646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 20:41:16,729 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 20:41:16,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 32 [2024-11-19 20:41:16,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159079371] [2024-11-19 20:41:16,730 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 20:41:16,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 20:41:16,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:41:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 20:41:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2024-11-19 20:41:16,732 INFO L87 Difference]: Start difference. First operand 81 states and 93 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-19 20:41:18,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:41:18,177 INFO L93 Difference]: Finished difference Result 185 states and 215 transitions. [2024-11-19 20:41:18,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-19 20:41:18,178 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-19 20:41:18,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:41:18,181 INFO L225 Difference]: With dead ends: 185 [2024-11-19 20:41:18,181 INFO L226 Difference]: Without dead ends: 152 [2024-11-19 20:41:18,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=347, Invalid=2305, Unknown=0, NotChecked=0, Total=2652 [2024-11-19 20:41:18,184 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 490 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 1365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 20:41:18,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 798 Invalid, 1365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 20:41:18,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-19 20:41:18,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 125. [2024-11-19 20:41:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 101 states have internal predecessors, (116), 16 states have call successors, (16), 10 states have call predecessors, (16), 10 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-19 20:41:18,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 148 transitions. [2024-11-19 20:41:18,207 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 148 transitions. Word has length 32 [2024-11-19 20:41:18,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:41:18,211 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 148 transitions. [2024-11-19 20:41:18,211 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-19 20:41:18,211 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 148 transitions. [2024-11-19 20:41:18,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:41:18,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:18,212 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-19 20:41:18,225 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-19 20:41:18,412 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-19 20:41:18,413 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:18,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:18,414 INFO L85 PathProgramCache]: Analyzing trace with hash -956788522, now seen corresponding path program 1 times [2024-11-19 20:41:18,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:18,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105027487] [2024-11-19 20:41:18,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:18,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:18,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:18,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:41:18,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:18,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 20:41:18,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:18,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:41:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:18,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 20:41:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:18,536 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-19 20:41:18,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 20:41:18,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105027487] [2024-11-19 20:41:18,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105027487] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 20:41:18,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 20:41:18,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 20:41:18,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970266181] [2024-11-19 20:41:18,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 20:41:18,537 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 20:41:18,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 20:41:18,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 20:41:18,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 20:41:18,538 INFO L87 Difference]: Start difference. First operand 125 states and 148 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-19 20:41:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 20:41:18,732 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2024-11-19 20:41:18,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 20:41:18,732 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-19 20:41:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 20:41:18,734 INFO L225 Difference]: With dead ends: 137 [2024-11-19 20:41:18,734 INFO L226 Difference]: Without dead ends: 135 [2024-11-19 20:41:18,734 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-19 20:41:18,735 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 31 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 20:41:18,735 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 241 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 20:41:18,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-11-19 20:41:18,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2024-11-19 20:41:18,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 102 states have (on average 1.196078431372549) internal successors, (122), 107 states have internal predecessors, (122), 16 states have call successors, (16), 10 states have call predecessors, (16), 12 states have return successors, (21), 15 states have call predecessors, (21), 16 states have call successors, (21) [2024-11-19 20:41:18,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 159 transitions. [2024-11-19 20:41:18,753 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 159 transitions. Word has length 34 [2024-11-19 20:41:18,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 20:41:18,754 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 159 transitions. [2024-11-19 20:41:18,754 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-19 20:41:18,755 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 159 transitions. [2024-11-19 20:41:18,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 20:41:18,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 20:41:18,756 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-19 20:41:18,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 20:41:18,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 20:41:18,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 20:41:18,758 INFO L85 PathProgramCache]: Analyzing trace with hash 617814783, now seen corresponding path program 1 times [2024-11-19 20:41:18,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 20:41:18,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1154308115] [2024-11-19 20:41:18,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 20:41:18,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 20:41:18,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:19,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4 [2024-11-19 20:41:19,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:19,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-19 20:41:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 20:41:20,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-11-19 20:41:20,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat