/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:57:00,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:57:00,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:57:00,991 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:57:00,991 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:57:00,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:57:00,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:57:00,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:57:01,000 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:57:01,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:57:01,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:57:01,002 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:57:01,003 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:57:01,003 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:57:01,004 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:57:01,004 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:57:01,005 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:57:01,006 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:57:01,007 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:57:01,008 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:57:01,009 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:57:01,013 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:57:01,016 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:57:01,017 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:57:01,024 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:57:01,025 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:57:01,025 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:57:01,026 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:57:01,026 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:57:01,026 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:57:01,027 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:57:01,027 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:57:01,027 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:57:01,028 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:57:01,028 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:57:01,029 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:57:01,029 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:57:01,029 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:57:01,029 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:57:01,030 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:57:01,030 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:57:01,033 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:57:01,061 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:57:01,061 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:57:01,061 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:57:01,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:57:01,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:57:01,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:57:01,062 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:57:01,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:57:01,063 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:57:01,063 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:57:01,063 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:57:01,063 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:57:01,063 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:57:01,064 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:57:01,064 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:57:01,064 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:57:01,065 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:57:01,066 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:57:01,066 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 11:57:01,269 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:57:01,290 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:57:01,292 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:57:01,293 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:57:01,293 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:57:01,294 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2022-01-10 11:57:01,343 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddeda6000/a3ec976916cb4d719471e8045c38035d/FLAG8df7178d7 [2022-01-10 11:57:01,714 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:57:01,715 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_double_lock.i [2022-01-10 11:57:01,724 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddeda6000/a3ec976916cb4d719471e8045c38035d/FLAG8df7178d7 [2022-01-10 11:57:02,117 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddeda6000/a3ec976916cb4d719471e8045c38035d [2022-01-10 11:57:02,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:57:02,120 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:57:02,123 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:57:02,123 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:57:02,125 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:57:02,126 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,127 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b6bd97b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02, skipping insertion in model container [2022-01-10 11:57:02,127 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,132 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:57:02,170 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:57:02,429 WARN L230 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_double_lock.i[25842,25855] [2022-01-10 11:57:02,431 WARN L230 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_double_lock.i[25967,25980] [2022-01-10 11:57:02,432 WARN L230 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_double_lock.i[26082,26095] [2022-01-10 11:57:02,433 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:57:02,440 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 11:57:02,443 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:57:02,478 WARN L230 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_double_lock.i[25842,25855] [2022-01-10 11:57:02,478 WARN L230 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_double_lock.i[25967,25980] [2022-01-10 11:57:02,479 WARN L230 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_double_lock.i[26082,26095] [2022-01-10 11:57:02,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:57:02,481 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:57:02,510 WARN L230 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_double_lock.i[25842,25855] [2022-01-10 11:57:02,510 WARN L230 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_double_lock.i[25967,25980] [2022-01-10 11:57:02,511 WARN L230 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_double_lock.i[26082,26095] [2022-01-10 11:57:02,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:57:02,530 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:57:02,530 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02 WrapperNode [2022-01-10 11:57:02,530 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:57:02,531 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:57:02,531 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:57:02,531 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:57:02,536 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,547 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,574 INFO L137 Inliner]: procedures = 140, calls = 57, calls flagged for inlining = 26, calls inlined = 37, statements flattened = 377 [2022-01-10 11:57:02,574 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:57:02,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:57:02,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:57:02,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:57:02,580 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,580 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,585 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,610 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,614 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,615 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,619 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:57:02,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:57:02,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:57:02,619 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:57:02,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (1/1) ... [2022-01-10 11:57:02,624 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:57:02,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:57:02,651 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 11:57:02,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 11:57:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:57:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:57:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:57:02,675 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:57:02,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:57:02,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 11:57:02,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:57:02,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:57:02,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:57:02,768 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:57:02,769 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:57:03,540 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:57:03,545 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:57:03,545 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-01-10 11:57:03,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:03 BoogieIcfgContainer [2022-01-10 11:57:03,547 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:57:03,547 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:57:03,547 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:57:03,548 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:57:03,550 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:03" (1/1) ... [2022-01-10 11:57:03,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:57:03 BasicIcfg [2022-01-10 11:57:03,642 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:57:03,643 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:57:03,643 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:57:03,645 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:57:03,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:57:02" (1/4) ... [2022-01-10 11:57:03,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba5d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:57:03, skipping insertion in model container [2022-01-10 11:57:03,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:57:02" (2/4) ... [2022-01-10 11:57:03,645 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba5d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:57:03, skipping insertion in model container [2022-01-10 11:57:03,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:57:03" (3/4) ... [2022-01-10 11:57:03,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ba5d411 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:57:03, skipping insertion in model container [2022-01-10 11:57:03,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:57:03" (4/4) ... [2022-01-10 11:57:03,646 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_double_lock.iTransformedIcfg [2022-01-10 11:57:03,670 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:57:03,670 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 5 error locations. [2022-01-10 11:57:03,702 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:57:03,706 INFO L339 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=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 11:57:03,706 INFO L340 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2022-01-10 11:57:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 89 states have (on average 1.449438202247191) internal successors, (129), 94 states have internal predecessors, (129), 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) [2022-01-10 11:57:03,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:57:03,719 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:03,720 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:03,720 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 11:57:03,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:03,723 INFO L85 PathProgramCache]: Analyzing trace with hash -523327796, now seen corresponding path program 1 times [2022-01-10 11:57:03,729 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:03,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475448602] [2022-01-10 11:57:03,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:03,730 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:03,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:03,888 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:03,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475448602] [2022-01-10 11:57:03,890 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475448602] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:03,890 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:03,890 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:57:03,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756170715] [2022-01-10 11:57:03,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:03,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:57:03,896 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:03,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:57:03,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:57:03,921 INFO L87 Difference]: Start difference. First operand has 95 states, 89 states have (on average 1.449438202247191) internal successors, (129), 94 states have internal predecessors, (129), 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-01-10 11:57:03,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:03,947 INFO L93 Difference]: Finished difference Result 186 states and 253 transitions. [2022-01-10 11:57:03,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:57:03,949 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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 14 [2022-01-10 11:57:03,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:03,961 INFO L225 Difference]: With dead ends: 186 [2022-01-10 11:57:03,961 INFO L226 Difference]: Without dead ends: 90 [2022-01-10 11:57:03,971 INFO L932 BasicCegarLoop]: 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 [2022-01-10 11:57:03,974 INFO L933 BasicCegarLoop]: 112 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, 112 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 [2022-01-10 11:57:03,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:57:03,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-01-10 11:57:03,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-01-10 11:57:03,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 89 states have internal predecessors, (107), 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) [2022-01-10 11:57:04,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2022-01-10 11:57:04,001 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 14 [2022-01-10 11:57:04,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:04,001 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2022-01-10 11:57:04,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 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) [2022-01-10 11:57:04,001 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-01-10 11:57:04,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:57:04,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:04,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:04,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:57:04,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 11:57:04,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:04,003 INFO L85 PathProgramCache]: Analyzing trace with hash -576545299, now seen corresponding path program 1 times [2022-01-10 11:57:04,003 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:04,003 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [47420321] [2022-01-10 11:57:04,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:04,003 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:04,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:04,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:04,099 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:04,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [47420321] [2022-01-10 11:57:04,099 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [47420321] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:04,099 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:04,099 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:57:04,099 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294022136] [2022-01-10 11:57:04,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:04,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:57:04,100 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:04,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:57:04,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:57:04,101 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-01-10 11:57:04,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:04,200 INFO L93 Difference]: Finished difference Result 147 states and 169 transitions. [2022-01-10 11:57:04,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:57:04,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 14 [2022-01-10 11:57:04,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:04,203 INFO L225 Difference]: With dead ends: 147 [2022-01-10 11:57:04,203 INFO L226 Difference]: Without dead ends: 143 [2022-01-10 11:57:04,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:57:04,204 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 51 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:04,204 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 277 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:57:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-01-10 11:57:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 94. [2022-01-10 11:57:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.247191011235955) internal successors, (111), 93 states have internal predecessors, (111), 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) [2022-01-10 11:57:04,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2022-01-10 11:57:04,211 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 14 [2022-01-10 11:57:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:04,211 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2022-01-10 11:57:04,211 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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) [2022-01-10 11:57:04,211 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2022-01-10 11:57:04,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:57:04,211 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:04,211 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:57:04,212 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:57:04,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 11:57:04,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:04,212 INFO L85 PathProgramCache]: Analyzing trace with hash -575591987, now seen corresponding path program 1 times [2022-01-10 11:57:04,212 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:04,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332179072] [2022-01-10 11:57:04,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:04,213 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:04,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:57:04,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:57:04,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:57:04,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332179072] [2022-01-10 11:57:04,351 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332179072] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:57:04,351 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:57:04,351 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:57:04,351 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108611873] [2022-01-10 11:57:04,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:57:04,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:57:04,352 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:57:04,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:57:04,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:57:04,352 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-01-10 11:57:04,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:57:04,666 INFO L93 Difference]: Finished difference Result 255 states and 299 transitions. [2022-01-10 11:57:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:57:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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 14 [2022-01-10 11:57:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:57:04,667 INFO L225 Difference]: With dead ends: 255 [2022-01-10 11:57:04,667 INFO L226 Difference]: Without dead ends: 170 [2022-01-10 11:57:04,668 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:57:04,669 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 156 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 11:57:04,669 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 187 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-10 11:57:04,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-01-10 11:57:04,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 110. [2022-01-10 11:57:04,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 106 states have (on average 1.1981132075471699) internal successors, (127), 109 states have internal predecessors, (127), 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) [2022-01-10 11:57:04,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 127 transitions. [2022-01-10 11:57:04,682 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 127 transitions. Word has length 14 [2022-01-10 11:57:04,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:57:04,682 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 127 transitions. [2022-01-10 11:57:04,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 3 states have internal predecessors, (14), 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) [2022-01-10 11:57:04,683 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 127 transitions. [2022-01-10 11:57:04,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-01-10 11:57:04,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:57:04,683 INFO L514 BasicCegarLoop]: 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] [2022-01-10 11:57:04,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:57:04,684 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (and 2 more)] === [2022-01-10 11:57:04,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:57:04,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1831308746, now seen corresponding path program 1 times [2022-01-10 11:57:04,684 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:57:04,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302728965] [2022-01-10 11:57:04,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:57:04,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:57:05,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 11:57:05,070 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-01-10 11:57:05,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-01-10 11:57:05,206 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-01-10 11:57:05,206 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-01-10 11:57:05,207 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2022-01-10 11:57:05,208 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 5 remaining) [2022-01-10 11:57:05,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 5 remaining) [2022-01-10 11:57:05,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (1 of 5 remaining) [2022-01-10 11:57:05,209 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (0 of 5 remaining) [2022-01-10 11:57:05,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:57:05,214 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-01-10 11:57:05,216 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2022-01-10 11:57:05,345 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:57:05 BasicIcfg [2022-01-10 11:57:05,345 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-01-10 11:57:05,345 INFO L158 Benchmark]: Toolchain (without parser) took 3225.03ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 116.5MB in the beginning and 159.9MB in the end (delta: -43.3MB). Peak memory consumption was 72.1MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,345 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 11:57:05,346 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.68ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 130.0MB in the end (delta: -13.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,346 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.90ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 126.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,346 INFO L158 Benchmark]: Boogie Preprocessor took 44.30ms. Allocated memory is still 165.7MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,346 INFO L158 Benchmark]: RCFGBuilder took 927.42ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 91.6MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,347 INFO L158 Benchmark]: IcfgTransformer took 94.63ms. Allocated memory is still 165.7MB. Free memory was 91.6MB in the beginning and 78.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,347 INFO L158 Benchmark]: TraceAbstraction took 1702.10ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 77.3MB in the beginning and 159.9MB in the end (delta: -82.6MB). Peak memory consumption was 32.9MB. Max. memory is 8.0GB. [2022-01-10 11:57:05,348 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 165.7MB. Free memory is still 135.0MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 407.68ms. Allocated memory is still 165.7MB. Free memory was 116.4MB in the beginning and 130.0MB in the end (delta: -13.6MB). Peak memory consumption was 12.9MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 42.90ms. Allocated memory is still 165.7MB. Free memory was 130.0MB in the beginning and 126.5MB in the end (delta: 3.5MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 44.30ms. Allocated memory is still 165.7MB. Free memory was 126.5MB in the beginning and 123.4MB in the end (delta: 3.2MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 927.42ms. Allocated memory is still 165.7MB. Free memory was 123.4MB in the beginning and 91.6MB in the end (delta: 31.8MB). Peak memory consumption was 31.5MB. Max. memory is 8.0GB. * IcfgTransformer took 94.63ms. Allocated memory is still 165.7MB. Free memory was 91.6MB in the beginning and 78.0MB in the end (delta: 13.6MB). Peak memory consumption was 13.6MB. Max. memory is 8.0GB. * TraceAbstraction took 1702.10ms. Allocated memory was 165.7MB in the beginning and 222.3MB in the end (delta: 56.6MB). Free memory was 77.3MB in the beginning and 159.9MB in the end (delta: -82.6MB). Peak memory consumption was 32.9MB. 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 - CounterExampleResult [Line: 669]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L665] struct ldv_list_head mutexes = { &(mutexes), &(mutexes) }; VAL [mutexes={-1:0}] [L692] CALL foo() [L681] FCALL ldv_initialize() [L682] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={-1:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-5:0}, mutexes={-1:0}, ptr={-5:0}, size=8] [L682] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) [L682] struct mutex *m1 = ldv_successful_malloc(sizeof(struct mutex)); [L683] CALL, EXPR ldv_successful_malloc(sizeof(struct mutex)) [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={-1:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=8, \result={-2:0}, mutexes={-1:0}, ptr={-2:0}, size=8] [L683] RET, EXPR ldv_successful_malloc(sizeof(struct mutex)) [L683] struct mutex *m2 = ldv_successful_malloc(sizeof(struct mutex)); [L684] CALL mutex_lock(m1) [L669] CALL ldv_is_in_set(m, &mutexes) [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L660] return 0; VAL [\result=0, __mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L669] RET ldv_is_in_set(m, &mutexes) [L669] COND FALSE !(ldv_is_in_set(m, &mutexes)) [L670] CALL ldv_set_add(m, &mutexes) [L636] CALL, EXPR ldv_is_in_set(new, s) [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L655] COND FALSE !(&m->list != (s)) VAL [__mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L660] return 0; VAL [\result=0, __mptr={-1:0}, e={-5:0}, e={-5:0}, m={-1:-8}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L636] RET, EXPR ldv_is_in_set(new, s) [L636] COND TRUE !ldv_is_in_set(new, s) [L637] struct ldv_list_element *le; [L638] CALL, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) [L576] void *ptr = malloc(size); [L577] CALL assume_abort_if_not(ptr!=0) [L565] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, mutexes={-1:0}] [L577] RET assume_abort_if_not(ptr!=0) [L578] return ptr; VAL [\old(size)=24, \result={-3:0}, mutexes={-1:0}, ptr={-3:0}, size=24] [L638] RET, EXPR ldv_successful_malloc(sizeof(struct ldv_list_element)) [L638] le = (struct ldv_list_element*)ldv_successful_malloc(sizeof(struct ldv_list_element)) [L639] le->e = new [L640] CALL ldv_list_add(&le->list, s) [L608] EXPR head->next [L608] CALL __ldv_list_add(new, head, head->next) [L596] next->prev = new [L597] new->next = next [L598] new->prev = prev [L599] prev->next = new VAL [mutexes={-1:0}, new={-3:-8}, new={-3:-8}, next={-1:0}, next={-1:0}, prev={-1:0}, prev={-1:0}] [L608] RET __ldv_list_add(new, head, head->next) [L640] RET ldv_list_add(&le->list, s) [L670] RET ldv_set_add(m, &mutexes) [L684] RET mutex_lock(m1) [L685] CALL mutex_lock(m1) [L669] CALL ldv_is_in_set(m, &mutexes) [L654] struct ldv_list_element *m; [L655] EXPR (s)->next [L655] const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); [L655] m = ({ const typeof( ((typeof(*m) *)0)->list ) *__mptr = ((s)->next); (typeof(*m) *)( (char *)__mptr - ((size_t) &((typeof(*m) *)0)->list) );}) VAL [__mptr={-3:-8}, e={-5:0}, e={-5:0}, m={-3:0}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L655] COND TRUE &m->list != (s) [L656] EXPR m->e VAL [__mptr={-3:-8}, e={-5:0}, e={-5:0}, m={-3:0}, m->e={-5:0}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L656] COND TRUE m->e == e [L657] return 1; VAL [\result=-1, __mptr={-3:-8}, e={-5:0}, e={-5:0}, m={-3:0}, mutexes={-1:0}, s={-1:0}, s={-1:0}] [L669] RET ldv_is_in_set(m, &mutexes) [L669] COND TRUE ldv_is_in_set(m, &mutexes) [L669] reach_error() VAL [m={-5:0}, m={-5:0}, mutexes={-1:0}] - UnprovableResult [Line: 669]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 673]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 673]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 677]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 95 locations, 5 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 207 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 207 mSDsluCounter, 576 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 291 mSDsCounter, 32 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 96 IncrementalHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 32 mSolverCounterUnsat, 285 mSDtfsCounter, 96 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=110occurred in iteration=3, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 109 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 72 NumberOfCodeBlocks, 72 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 39 ConstructedInterpolants, 0 QuantifiedInterpolants, 219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2022-01-10 11:57:05,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...