/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i -------------------------------------------------------------------------------- This is Ultimate 0.2.4-tmp.fs.bitabs-eval-d9c3e40-m [2023-12-24 21:22:25,217 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-12-24 21:22:25,286 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Bitvector.epf [2023-12-24 21:22:25,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-12-24 21:22:25,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-12-24 21:22:25,315 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-12-24 21:22:25,316 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-12-24 21:22:25,316 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-12-24 21:22:25,316 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-12-24 21:22:25,317 INFO L153 SettingsManager]: * Use memory slicer=true [2023-12-24 21:22:25,317 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-12-24 21:22:25,317 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-12-24 21:22:25,318 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-12-24 21:22:25,318 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-12-24 21:22:25,319 INFO L153 SettingsManager]: * Use SBE=true [2023-12-24 21:22:25,319 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-12-24 21:22:25,319 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-12-24 21:22:25,320 INFO L153 SettingsManager]: * sizeof long=4 [2023-12-24 21:22:25,320 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-12-24 21:22:25,320 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-12-24 21:22:25,321 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-12-24 21:22:25,321 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-12-24 21:22:25,321 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-12-24 21:22:25,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-12-24 21:22:25,325 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-12-24 21:22:25,325 INFO L153 SettingsManager]: * Allow undefined functions=false [2023-12-24 21:22:25,326 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-12-24 21:22:25,326 INFO L153 SettingsManager]: * sizeof long double=12 [2023-12-24 21:22:25,326 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-12-24 21:22:25,326 INFO L153 SettingsManager]: * Use constant arrays=true [2023-12-24 21:22:25,327 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-12-24 21:22:25,327 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-12-24 21:22:25,327 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-12-24 21:22:25,328 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-12-24 21:22:25,328 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:22:25,328 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-12-24 21:22:25,328 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-12-24 21:22:25,329 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-12-24 21:22:25,329 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-12-24 21:22:25,329 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-12-24 21:22:25,330 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-12-24 21:22:25,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-12-24 21:22:25,335 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-12-24 21:22:25,335 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-12-24 21:22:25,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-12-24 21:22:25,335 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-12-24 21:22:25,335 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 [2023-12-24 21:22:25,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-12-24 21:22:25,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-12-24 21:22:25,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-12-24 21:22:25,566 INFO L270 PluginConnector]: Initializing CDTParser... [2023-12-24 21:22:25,566 INFO L274 PluginConnector]: CDTParser initialized [2023-12-24 21:22:25,568 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-24 21:22:26,732 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-12-24 21:22:26,968 INFO L384 CDTParser]: Found 1 translation units. [2023-12-24 21:22:26,969 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i [2023-12-24 21:22:26,988 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492403002/dd0ac461d4514930b778abca964cff38/FLAGec0ccef2e [2023-12-24 21:22:27,004 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/492403002/dd0ac461d4514930b778abca964cff38 [2023-12-24 21:22:27,006 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-12-24 21:22:27,008 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2023-12-24 21:22:27,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-12-24 21:22:27,010 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-12-24 21:22:27,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-12-24 21:22:27,015 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,016 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@181e8e64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27, skipping insertion in model container [2023-12-24 21:22:27,016 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,058 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:22:27,307 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-24 21:22:27,311 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-24 21:22:27,314 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-24 21:22:27,316 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:27,344 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-12-24 21:22:27,358 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-12-24 21:22:27,398 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-24 21:22:27,399 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-24 21:22:27,399 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-24 21:22:27,401 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:27,403 INFO L202 MainTranslator]: Completed pre-run [2023-12-24 21:22:27,453 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25842,25855] [2023-12-24 21:22:27,454 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[25967,25980] [2023-12-24 21:22:27,455 WARN L239 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unlock_at_exit.i[26082,26095] [2023-12-24 21:22:27,456 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-12-24 21:22:27,495 INFO L206 MainTranslator]: Completed translation [2023-12-24 21:22:27,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27 WrapperNode [2023-12-24 21:22:27,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-12-24 21:22:27,496 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-12-24 21:22:27,496 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-12-24 21:22:27,496 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-12-24 21:22:27,502 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,543 INFO L138 Inliner]: procedures = 140, calls = 56, calls flagged for inlining = 15, calls inlined = 14, statements flattened = 135 [2023-12-24 21:22:27,544 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-12-24 21:22:27,544 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-12-24 21:22:27,544 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-12-24 21:22:27,544 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-12-24 21:22:27,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,558 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,597 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [2, 20]. 91 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 2]. The 7 writes are split as follows [0, 7]. [2023-12-24 21:22:27,597 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,598 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,607 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,613 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,617 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-12-24 21:22:27,618 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-12-24 21:22:27,618 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-12-24 21:22:27,618 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-12-24 21:22:27,618 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (1/1) ... [2023-12-24 21:22:27,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-12-24 21:22:27,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-12-24 21:22:27,641 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) [2023-12-24 21:22:27,643 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 [2023-12-24 21:22:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2023-12-24 21:22:27,663 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2023-12-24 21:22:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-12-24 21:22:27,663 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2023-12-24 21:22:27,663 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2023-12-24 21:22:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-12-24 21:22:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-12-24 21:22:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-12-24 21:22:27,664 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2023-12-24 21:22:27,664 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2023-12-24 21:22:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-12-24 21:22:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-12-24 21:22:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-12-24 21:22:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-12-24 21:22:27,665 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-12-24 21:22:27,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-12-24 21:22:27,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-12-24 21:22:27,668 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2023-12-24 21:22:27,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2023-12-24 21:22:27,668 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-12-24 21:22:27,668 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-12-24 21:22:27,798 INFO L241 CfgBuilder]: Building ICFG [2023-12-24 21:22:27,799 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-12-24 21:22:28,169 INFO L282 CfgBuilder]: Performing block encoding [2023-12-24 21:22:28,221 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-12-24 21:22:28,221 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-12-24 21:22:28,222 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:22:28 BoogieIcfgContainer [2023-12-24 21:22:28,222 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-12-24 21:22:28,224 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-12-24 21:22:28,224 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-12-24 21:22:28,226 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-12-24 21:22:28,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.12 09:22:27" (1/3) ... [2023-12-24 21:22:28,227 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23218ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:22:28, skipping insertion in model container [2023-12-24 21:22:28,227 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.12 09:22:27" (2/3) ... [2023-12-24 21:22:28,228 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23218ba5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.12 09:22:28, skipping insertion in model container [2023-12-24 21:22:28,228 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.12 09:22:28" (3/3) ... [2023-12-24 21:22:28,229 INFO L112 eAbstractionObserver]: Analyzing ICFG test_mutex_unlock_at_exit.i [2023-12-24 21:22:28,243 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-12-24 21:22:28,243 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2023-12-24 21:22:28,283 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-12-24 21:22:28,287 INFO L357 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, mHoare=true, 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;@19d99928, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-12-24 21:22:28,287 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2023-12-24 21:22:28,290 INFO L276 IsEmpty]: Start isEmpty. Operand has 48 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 21:22:28,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:22:28,297 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:28,297 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:28,298 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:28,302 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:28,302 INFO L85 PathProgramCache]: Analyzing trace with hash -550397111, now seen corresponding path program 1 times [2023-12-24 21:22:28,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:28,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [281425726] [2023-12-24 21:22:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:28,314 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:28,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:28,319 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:22:28,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-12-24 21:22:28,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:28,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 1 conjunts are in the unsatisfiable core [2023-12-24 21:22:28,463 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:28,487 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:22:28,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:28,488 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:28,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [281425726] [2023-12-24 21:22:28,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [281425726] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:28,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:28,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-12-24 21:22:28,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921552534] [2023-12-24 21:22:28,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:28,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-12-24 21:22:28,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:28,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-12-24 21:22:28,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:22:28,525 INFO L87 Difference]: Start difference. First operand has 48 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 34 states have internal predecessors, (45), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:28,609 INFO L93 Difference]: Finished difference Result 94 states and 131 transitions. [2023-12-24 21:22:28,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-12-24 21:22:28,612 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), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-24 21:22:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:28,619 INFO L225 Difference]: With dead ends: 94 [2023-12-24 21:22:28,620 INFO L226 Difference]: Without dead ends: 46 [2023-12-24 21:22:28,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-12-24 21:22:28,627 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:28,628 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-12-24 21:22:28,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2023-12-24 21:22:28,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2023-12-24 21:22:28,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 9 states have call successors, (9), 4 states have call predecessors, (9), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2023-12-24 21:22:28,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 55 transitions. [2023-12-24 21:22:28,671 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 55 transitions. Word has length 23 [2023-12-24 21:22:28,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:28,672 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 55 transitions. [2023-12-24 21:22:28,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:28,672 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 55 transitions. [2023-12-24 21:22:28,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:22:28,674 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:28,674 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:28,681 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-12-24 21:22:28,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:28,879 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:28,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:28,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1629512975, now seen corresponding path program 1 times [2023-12-24 21:22:28,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:28,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [807440290] [2023-12-24 21:22:28,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:28,881 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:28,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:28,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:22:28,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-12-24 21:22:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:28,972 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:22:28,974 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:29,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:22:29,019 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:29,020 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:29,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [807440290] [2023-12-24 21:22:29,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [807440290] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:29,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:29,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:22:29,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020197833] [2023-12-24 21:22:29,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:29,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:22:29,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:29,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:22:29,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:29,024 INFO L87 Difference]: Start difference. First operand 46 states and 55 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:29,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:29,186 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2023-12-24 21:22:29,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:22:29,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-24 21:22:29,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:29,189 INFO L225 Difference]: With dead ends: 51 [2023-12-24 21:22:29,190 INFO L226 Difference]: Without dead ends: 49 [2023-12-24 21:22:29,190 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:29,191 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:29,191 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 135 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:22:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2023-12-24 21:22:29,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2023-12-24 21:22:29,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 9 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (12), 10 states have call predecessors, (12), 9 states have call successors, (12) [2023-12-24 21:22:29,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2023-12-24 21:22:29,200 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 23 [2023-12-24 21:22:29,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:29,200 INFO L495 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2023-12-24 21:22:29,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:29,201 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2023-12-24 21:22:29,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-12-24 21:22:29,201 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:29,201 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:29,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-12-24 21:22:29,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:29,408 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:29,409 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:29,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1680306630, now seen corresponding path program 1 times [2023-12-24 21:22:29,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:29,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298562123] [2023-12-24 21:22:29,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:29,410 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:29,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:29,411 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:22:29,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-12-24 21:22:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:29,499 INFO L262 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 14 conjunts are in the unsatisfiable core [2023-12-24 21:22:29,502 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:29,887 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-12-24 21:22:29,887 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:29,887 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:29,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298562123] [2023-12-24 21:22:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298562123] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:29,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:29,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:22:29,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115826998] [2023-12-24 21:22:29,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:29,890 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-12-24 21:22:29,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:29,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-12-24 21:22:29,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-12-24 21:22:29,892 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:30,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:30,380 INFO L93 Difference]: Finished difference Result 135 states and 172 transitions. [2023-12-24 21:22:30,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-12-24 21:22:30,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2023-12-24 21:22:30,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:30,382 INFO L225 Difference]: With dead ends: 135 [2023-12-24 21:22:30,382 INFO L226 Difference]: Without dead ends: 92 [2023-12-24 21:22:30,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2023-12-24 21:22:30,384 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 39 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:30,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 111 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-12-24 21:22:30,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-12-24 21:22:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 75. [2023-12-24 21:22:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 53 states have internal predecessors, (60), 14 states have call successors, (14), 7 states have call predecessors, (14), 9 states have return successors, (20), 14 states have call predecessors, (20), 14 states have call successors, (20) [2023-12-24 21:22:30,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 94 transitions. [2023-12-24 21:22:30,397 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 94 transitions. Word has length 23 [2023-12-24 21:22:30,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:30,397 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 94 transitions. [2023-12-24 21:22:30,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 1 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2023-12-24 21:22:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 94 transitions. [2023-12-24 21:22:30,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-12-24 21:22:30,399 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:30,399 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:30,407 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-12-24 21:22:30,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:30,604 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:30,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:30,605 INFO L85 PathProgramCache]: Analyzing trace with hash -74410856, now seen corresponding path program 1 times [2023-12-24 21:22:30,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:30,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2056917823] [2023-12-24 21:22:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:30,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:30,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:30,607 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:22:30,609 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-12-24 21:22:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:30,727 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 3 conjunts are in the unsatisfiable core [2023-12-24 21:22:30,730 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:30,768 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-12-24 21:22:30,769 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-12-24 21:22:30,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:22:30,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2056917823] [2023-12-24 21:22:30,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2056917823] provided 1 perfect and 0 imperfect interpolant sequences [2023-12-24 21:22:30,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-12-24 21:22:30,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-12-24 21:22:30,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941834371] [2023-12-24 21:22:30,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-12-24 21:22:30,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-12-24 21:22:30,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-12-24 21:22:30,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-12-24 21:22:30,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:30,771 INFO L87 Difference]: Start difference. First operand 75 states and 94 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-24 21:22:30,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-12-24 21:22:30,953 INFO L93 Difference]: Finished difference Result 133 states and 166 transitions. [2023-12-24 21:22:30,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-12-24 21:22:30,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) Word has length 60 [2023-12-24 21:22:30,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-12-24 21:22:30,958 INFO L225 Difference]: With dead ends: 133 [2023-12-24 21:22:30,958 INFO L226 Difference]: Without dead ends: 79 [2023-12-24 21:22:30,959 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-12-24 21:22:30,959 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-12-24 21:22:30,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 134 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-12-24 21:22:30,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2023-12-24 21:22:30,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2023-12-24 21:22:30,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 52 states have (on average 1.2115384615384615) internal successors, (63), 55 states have internal predecessors, (63), 14 states have call successors, (14), 7 states have call predecessors, (14), 10 states have return successors, (21), 16 states have call predecessors, (21), 14 states have call successors, (21) [2023-12-24 21:22:30,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 98 transitions. [2023-12-24 21:22:30,978 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 98 transitions. Word has length 60 [2023-12-24 21:22:30,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-12-24 21:22:30,978 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 98 transitions. [2023-12-24 21:22:30,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 3 states have internal predecessors, (28), 2 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 2 states have call successors, (9) [2023-12-24 21:22:30,979 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 98 transitions. [2023-12-24 21:22:30,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2023-12-24 21:22:30,984 INFO L187 NwaCegarLoop]: Found error trace [2023-12-24 21:22:30,984 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-12-24 21:22:30,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-12-24 21:22:31,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:31,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2023-12-24 21:22:31,193 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-12-24 21:22:31,193 INFO L85 PathProgramCache]: Analyzing trace with hash -371617829, now seen corresponding path program 1 times [2023-12-24 21:22:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-12-24 21:22:31,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461252412] [2023-12-24 21:22:31,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-12-24 21:22:31,194 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-12-24 21:22:31,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-12-24 21:22:31,195 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-12-24 21:22:31,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-12-24 21:22:31,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-12-24 21:22:31,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 251 conjuncts, 85 conjunts are in the unsatisfiable core [2023-12-24 21:22:31,431 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-12-24 21:22:31,481 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 0 case distinctions, treesize of input 6 treesize of output 7 [2023-12-24 21:22:31,713 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-12-24 21:22:31,714 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 13 treesize of output 13 [2023-12-24 21:22:31,798 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 7 treesize of output 3 [2023-12-24 21:22:32,533 INFO L349 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2023-12-24 21:22:32,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 236 [2023-12-24 21:22:32,568 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 21:22:32,695 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 21:22:32,729 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 21:22:32,765 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 0 case distinctions, treesize of input 8 treesize of output 7 [2023-12-24 21:22:33,552 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:22:33,593 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-24 21:22:33,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 851 treesize of output 827 [2023-12-24 21:22:33,712 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 5 treesize of output 3 [2023-12-24 21:22:33,733 WARN L214 Elim1Store]: Array PQE input equivalent to false [2023-12-24 21:22: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 5 treesize of output 3 [2023-12-24 21:22:33,813 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 5 treesize of output 3 [2023-12-24 21:22:33,889 INFO L349 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2023-12-24 21:22:33,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 45 [2023-12-24 21:22:34,100 WARN L876 $PredicateComparison]: unable to prove that (and (exists ((__ldv_list_add_~next.offset (_ BitVec 32))) (= (let ((.cse0 (let ((.cse1 (store |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base| (store (select |c_old(#memory_$Pointer$#1.base)| |c___ldv_list_add_#in~next.base|) (bvadd (_ bv4 32) __ldv_list_add_~next.offset) |c___ldv_list_add_#in~new.base|)))) (store .cse1 |c___ldv_list_add_#in~new.base| (store (store (select .cse1 |c___ldv_list_add_#in~new.base|) |c___ldv_list_add_#in~new.offset| |c___ldv_list_add_#in~next.base|) (bvadd |c___ldv_list_add_#in~new.offset| (_ bv4 32)) |c___ldv_list_add_#in~prev.base|))))) (store .cse0 |c___ldv_list_add_#in~prev.base| (store (select .cse0 |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.base|))) |c_#memory_$Pointer$#1.base|)) (let ((.cse11 (= |c___ldv_list_add_#in~new.base| |c___ldv_list_add_#in~prev.base|)) (.cse7 (= |c___ldv_list_add_#in~new.offset| (select (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~prev.base|) |c___ldv_list_add_#in~prev.offset|)))) (or (and (let ((.cse4 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~new.base|)) (.cse2 (= |c___ldv_list_add_#in~next.base| |c___ldv_list_add_#in~prev.base|))) (or (and (not .cse2) (exists ((v_DerPreprocessor_8 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_9 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_7 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_7) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_8) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_9))) (let ((.cse3 (select .cse6 |c___ldv_list_add_#in~next.base|)) (.cse5 (select .cse6 |c___ldv_list_add_#in~new.base|))) (and (= .cse3 (select |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base|)) (= .cse4 .cse5) (= .cse3 v_DerPreprocessor_7) (= v_DerPreprocessor_9 (store .cse5 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)))))) .cse7) (and (exists ((v_DerPreprocessor_12 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_11 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_4 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_5 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_6 (Array (_ BitVec 32) (_ BitVec 32))) (v_DerPreprocessor_10 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse10 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_10) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_11) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_12))) (let ((.cse8 (select .cse10 |c___ldv_list_add_#in~new.base|)) (.cse9 (store (store (store |c_#memory_$Pointer$#1.offset| |c___ldv_list_add_#in~next.base| v_DerPreprocessor_4) |c___ldv_list_add_#in~new.base| v_DerPreprocessor_5) |c___ldv_list_add_#in~prev.base| v_DerPreprocessor_6))) (and (= v_DerPreprocessor_12 (store .cse8 |c___ldv_list_add_#in~prev.offset| |c___ldv_list_add_#in~new.offset|)) (= .cse8 (select .cse9 |c___ldv_list_add_#in~new.base|)) (= |c___ldv_list_add_#in~new.offset| (select v_DerPreprocessor_6 |c___ldv_list_add_#in~prev.offset|)) (= (select .cse10 |c___ldv_list_add_#in~next.base|) v_DerPreprocessor_10) (= .cse4 .cse8) (= v_DerPreprocessor_4 (select .cse9 |c___ldv_list_add_#in~next.base|)))))) .cse2 .cse7))) (not .cse11)) (and .cse11 .cse7))) (= |c_~#mutexes~0.offset| (_ bv0 32))) is different from true [2023-12-24 21:23:57,040 WARN L293 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 129 DAG size of output: 69 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2023-12-24 21:23:57,040 INFO L349 Elim1Store]: treesize reduction 796, result has 32.5 percent of original size [2023-12-24 21:23:57,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 9 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 12 new quantified variables, introduced 20 case distinctions, treesize of input 3728 treesize of output 2404 [2023-12-24 21:23:57,362 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,440 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,448 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,631 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,642 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,646 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,662 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,731 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,837 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,846 INFO L173 IndexEqualityManager]: detected equality via solver [2023-12-24 21:23:57,846 INFO L224 Elim1Store]: Index analysis took 428 ms [2023-12-24 21:23:59,046 INFO L349 Elim1Store]: treesize reduction 101, result has 10.6 percent of original size [2023-12-24 21:23:59,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 8 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 17 case distinctions, treesize of input 1598 treesize of output 2182 [2023-12-24 21:24:03,412 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 1 [2023-12-24 21:24:12,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 425 treesize of output 529 Received shutdown request... [2023-12-24 21:37:06,164 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:37:06,164 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-12-24 21:37:07,174 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-12-24 21:37:07,371 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2023-12-24 21:37:07,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 [2023-12-24 21:37:07,400 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-12-24 21:37:07,402 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location mutex_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2023-12-24 21:37:07,402 WARN L619 AbstractCegarLoop]: Verification canceled: while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [461252412]. [2023-12-24 21:37:07,403 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2023-12-24 21:37:07,403 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2023-12-24 21:37:07,406 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-12-24 21:37:07,408 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2023-12-24 21:37:07,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.12 09:37:07 BoogieIcfgContainer [2023-12-24 21:37:07,410 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-12-24 21:37:07,410 INFO L158 Benchmark]: Toolchain (without parser) took 880402.51ms. Allocated memory was 189.8MB in the beginning and 346.0MB in the end (delta: 156.2MB). Free memory was 139.3MB in the beginning and 218.4MB in the end (delta: -79.1MB). Peak memory consumption was 184.5MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,410 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. [2023-12-24 21:37:07,410 INFO L158 Benchmark]: CACSL2BoogieTranslator took 485.56ms. Allocated memory is still 189.8MB. Free memory was 139.1MB in the beginning and 113.1MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.55ms. Allocated memory is still 189.8MB. Free memory was 112.9MB in the beginning and 110.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,411 INFO L158 Benchmark]: Boogie Preprocessor took 72.90ms. Allocated memory is still 189.8MB. Free memory was 110.4MB in the beginning and 104.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,411 INFO L158 Benchmark]: RCFGBuilder took 604.16ms. Allocated memory was 189.8MB in the beginning and 288.4MB in the end (delta: 98.6MB). Free memory was 104.8MB in the beginning and 239.0MB in the end (delta: -134.2MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,411 INFO L158 Benchmark]: TraceAbstraction took 879186.05ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 238.4MB in the beginning and 218.4MB in the end (delta: 20.0MB). Peak memory consumption was 184.6MB. Max. memory is 8.0GB. [2023-12-24 21:37:07,412 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 189.8MB. Free memory is still 135.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 485.56ms. Allocated memory is still 189.8MB. Free memory was 139.1MB in the beginning and 113.1MB in the end (delta: 26.0MB). Peak memory consumption was 26.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 47.55ms. Allocated memory is still 189.8MB. Free memory was 112.9MB in the beginning and 110.4MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 72.90ms. Allocated memory is still 189.8MB. Free memory was 110.4MB in the beginning and 104.8MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 8.0GB. * RCFGBuilder took 604.16ms. Allocated memory was 189.8MB in the beginning and 288.4MB in the end (delta: 98.6MB). Free memory was 104.8MB in the beginning and 239.0MB in the end (delta: -134.2MB). Peak memory consumption was 18.8MB. Max. memory is 8.0GB. * TraceAbstraction took 879186.05ms. Allocated memory was 288.4MB in the beginning and 346.0MB in the end (delta: 57.7MB). Free memory was 238.4MB in the beginning and 218.4MB in the end (delta: 20.0MB). Peak memory consumption was 184.6MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - TimeoutResultAtElement [Line: 669]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 669). Cancelled while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [461252412]. - TimeoutResultAtElement [Line: 673]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 673). Cancelled while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [461252412]. - TimeoutResultAtElement [Line: 677]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable (line 677). Cancelled while NwaCegarLoop was analyzing trace of length 53 with TraceHistMax 3,while AutomatonFreeRefinementEngine was Timeout during proof generation before using IpTcStrategyModuleMathsat [461252412]. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 48 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 879.1s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 43 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 39 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 248 mSDsCounter, 2 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 168 IncrementalHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2 mSolverCounterUnsat, 180 mSDtfsCounter, 168 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=4, InterpolantAutomatonStates: 16, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 17 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 129 NumberOfCodeBlocks, 129 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 125 ConstructedInterpolants, 0 QuantifiedInterpolants, 550 SizeOfPredicates, 6 NumberOfNonLiveVariables, 504 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 74/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown