/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_SUM.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:24:41,693 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:24:41,695 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:24:41,748 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:24:41,748 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:24:41,750 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:24:41,753 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:24:41,757 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:24:41,758 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:24:41,762 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:24:41,762 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:24:41,763 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:24:41,763 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:24:41,765 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:24:41,766 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:24:41,767 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:24:41,768 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:24:41,770 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:24:41,772 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:24:41,773 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:24:41,774 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:24:41,776 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:24:41,777 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:24:41,778 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:24:41,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:24:41,783 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:24:41,783 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:24:41,784 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:24:41,784 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:24:41,785 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:24:41,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:24:41,785 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:24:41,786 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:24:41,786 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:24:41,787 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:24:41,787 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:24:41,787 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:24:41,787 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:24:41,788 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:24:41,788 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:24:41,789 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:24:41,791 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:24:41,818 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:24:41,818 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:24:41,819 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:24:41,819 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:24:41,819 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:24:41,820 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:24:41,820 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:24:41,820 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:24:41,820 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:24:41,820 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:24:41,820 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:24:41,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:24:41,821 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:24:41,822 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:41,822 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:24:41,822 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:24:41,822 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:24:41,823 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:24:41,824 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:24:41,824 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:24:41,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:24:42,009 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:24:42,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:24:42,012 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:24:42,012 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:24:42,013 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2022-01-11 05:24:42,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc728104/050142c744064a9ead673d365624cc4f/FLAGc8e1ef2df [2022-01-11 05:24:42,458 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:24:42,458 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-1.i [2022-01-11 05:24:42,472 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc728104/050142c744064a9ead673d365624cc4f/FLAGc8e1ef2df [2022-01-11 05:24:42,824 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fc728104/050142c744064a9ead673d365624cc4f [2022-01-11 05:24:42,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:24:42,828 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:24:42,831 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:42,831 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:24:42,833 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:24:42,834 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:42" (1/1) ... [2022-01-11 05:24:42,835 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@240e7e1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:42, skipping insertion in model container [2022-01-11 05:24:42,835 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:24:42" (1/1) ... [2022-01-11 05:24:42,840 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:24:42,877 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:24:43,114 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_unbounded-1.i[26271,26284] [2022-01-11 05:24:43,116 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_unbounded-1.i[26396,26409] [2022-01-11 05:24:43,117 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_unbounded-1.i[26511,26524] [2022-01-11 05:24:43,125 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:43,148 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-11 05:24:43,153 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:24:43,177 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_unbounded-1.i[26271,26284] [2022-01-11 05:24:43,178 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_unbounded-1.i[26396,26409] [2022-01-11 05:24:43,178 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_unbounded-1.i[26511,26524] [2022-01-11 05:24:43,191 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:43,193 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:24:43,230 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_unbounded-1.i[26271,26284] [2022-01-11 05:24:43,231 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_unbounded-1.i[26396,26409] [2022-01-11 05:24:43,232 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_unbounded-1.i[26511,26524] [2022-01-11 05:24:43,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:24:43,261 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:24:43,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43 WrapperNode [2022-01-11 05:24:43,262 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:24:43,263 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:43,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:24:43,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:24:43,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,305 INFO L137 Inliner]: procedures = 143, calls = 62, calls flagged for inlining = 24, calls inlined = 24, statements flattened = 259 [2022-01-11 05:24:43,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:24:43,306 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:24:43,306 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:24:43,306 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:24:43,312 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,312 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,317 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,317 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,331 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,335 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,336 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,339 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:24:43,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:24:43,340 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:24:43,340 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:24:43,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (1/1) ... [2022-01-11 05:24:43,353 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:24:43,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:43,372 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-11 05:24:43,390 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-11 05:24:43,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:24:43,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:24:43,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:24:43,558 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:24:43,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:24:44,207 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:24:44,213 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:24:44,213 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-11 05:24:44,215 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:44 BoogieIcfgContainer [2022-01-11 05:24:44,215 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:24:44,216 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:24:44,216 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:24:44,216 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:24:44,218 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:44" (1/1) ... [2022-01-11 05:24:44,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:44 BasicIcfg [2022-01-11 05:24:44,340 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:24:44,341 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:24:44,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:24:44,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:24:44,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:24:42" (1/4) ... [2022-01-11 05:24:44,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499b532d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:44, skipping insertion in model container [2022-01-11 05:24:44,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:24:43" (2/4) ... [2022-01-11 05:24:44,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499b532d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:24:44, skipping insertion in model container [2022-01-11 05:24:44,345 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:24:44" (3/4) ... [2022-01-11 05:24:44,345 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@499b532d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:24:44, skipping insertion in model container [2022-01-11 05:24:44,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:24:44" (4/4) ... [2022-01-11 05:24:44,346 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-1.iTransformedIcfg [2022-01-11 05:24:44,351 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:24:44,351 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-11 05:24:44,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:24:44,393 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-11 05:24:44,394 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-11 05:24:44,408 INFO L276 IsEmpty]: Start isEmpty. Operand has 65 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 64 states have internal predecessors, (88), 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-11 05:24:44,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 05:24:44,413 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:44,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:44,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:44,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:44,418 INFO L85 PathProgramCache]: Analyzing trace with hash -217617470, now seen corresponding path program 1 times [2022-01-11 05:24:44,425 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:44,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425380732] [2022-01-11 05:24:44,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:44,427 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:44,621 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-11 05:24:44,623 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:44,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425380732] [2022-01-11 05:24:44,624 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425380732] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:44,624 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:44,625 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:24:44,626 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096993924] [2022-01-11 05:24:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:44,630 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:24:44,630 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:44,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:24:44,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:24:44,661 INFO L87 Difference]: Start difference. First operand has 65 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 64 states have internal predecessors, (88), 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 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11 05:24:44,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:44,687 INFO L93 Difference]: Finished difference Result 127 states and 173 transitions. [2022-01-11 05:24:44,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:24:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2022-01-11 05:24:44,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:44,698 INFO L225 Difference]: With dead ends: 127 [2022-01-11 05:24:44,698 INFO L226 Difference]: Without dead ends: 60 [2022-01-11 05:24:44,710 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-11 05:24:44,713 INFO L933 BasicCegarLoop]: 76 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, 76 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-11 05:24:44,714 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:24:44,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-01-11 05:24:44,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-01-11 05:24:44,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 57 states have (on average 1.2456140350877194) internal successors, (71), 59 states have internal predecessors, (71), 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-11 05:24:44,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 71 transitions. [2022-01-11 05:24:44,746 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 71 transitions. Word has length 11 [2022-01-11 05:24:44,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:44,746 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 71 transitions. [2022-01-11 05:24:44,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-11 05:24:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 71 transitions. [2022-01-11 05:24:44,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 05:24:44,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:44,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:44,749 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:24:44,749 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:44,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:44,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1526116386, now seen corresponding path program 1 times [2022-01-11 05:24:44,752 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:44,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568331275] [2022-01-11 05:24:44,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:44,753 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:44,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:44,850 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-11 05:24:44,850 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:44,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568331275] [2022-01-11 05:24:44,851 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568331275] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:44,851 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:44,851 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-11 05:24:44,851 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682497804] [2022-01-11 05:24:44,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:44,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:24:44,852 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:44,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:24:44,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:24:44,853 INFO L87 Difference]: Start difference. First operand 60 states and 71 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11 05:24:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:44,935 INFO L93 Difference]: Finished difference Result 97 states and 112 transitions. [2022-01-11 05:24:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:24:44,936 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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 11 [2022-01-11 05:24:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:44,937 INFO L225 Difference]: With dead ends: 97 [2022-01-11 05:24:44,937 INFO L226 Difference]: Without dead ends: 95 [2022-01-11 05:24:44,937 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-11 05:24:44,938 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 35 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:44,938 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 210 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:24:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-11 05:24:44,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 62. [2022-01-11 05:24:44,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.2372881355932204) internal successors, (73), 61 states have internal predecessors, (73), 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-11 05:24:44,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-01-11 05:24:44,943 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 11 [2022-01-11 05:24:44,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:44,944 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-01-11 05:24:44,944 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 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-11 05:24:44,944 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-01-11 05:24:44,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-11 05:24:44,944 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:44,944 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:44,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:24:44,945 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:44,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:44,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1527069698, now seen corresponding path program 1 times [2022-01-11 05:24:44,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:44,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642730035] [2022-01-11 05:24:44,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:44,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:44,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:45,194 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-11 05:24:45,195 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:45,195 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642730035] [2022-01-11 05:24:45,195 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642730035] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:45,195 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:45,195 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:24:45,196 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [866569583] [2022-01-11 05:24:45,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:45,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-11 05:24:45,201 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:45,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-11 05:24:45,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-11 05:24:45,202 INFO L87 Difference]: Start difference. First operand 62 states and 73 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11 05:24:45,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:45,621 INFO L93 Difference]: Finished difference Result 127 states and 150 transitions. [2022-01-11 05:24:45,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:24:45,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-01-11 05:24:45,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:45,622 INFO L225 Difference]: With dead ends: 127 [2022-01-11 05:24:45,622 INFO L226 Difference]: Without dead ends: 76 [2022-01-11 05:24:45,622 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:24:45,623 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 18 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:45,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 158 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-01-11 05:24:45,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-01-11 05:24:45,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 67. [2022-01-11 05:24:45,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.234375) internal successors, (79), 66 states have internal predecessors, (79), 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-11 05:24:45,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 79 transitions. [2022-01-11 05:24:45,629 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 79 transitions. Word has length 11 [2022-01-11 05:24:45,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:45,629 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 79 transitions. [2022-01-11 05:24:45,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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-11 05:24:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 79 transitions. [2022-01-11 05:24:45,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-11 05:24:45,629 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:45,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:45,630 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:24:45,630 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:45,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:45,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1564885081, now seen corresponding path program 1 times [2022-01-11 05:24:45,630 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:45,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774866620] [2022-01-11 05:24:45,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:45,631 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:45,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:45,739 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-11 05:24:45,739 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:45,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774866620] [2022-01-11 05:24:45,739 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774866620] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:24:45,740 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:24:45,740 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:24:45,740 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236124110] [2022-01-11 05:24:45,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:24:45,740 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:24:45,740 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:45,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:24:45,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:24:45,741 INFO L87 Difference]: Start difference. First operand 67 states and 79 transitions. Second operand has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:46,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:46,027 INFO L93 Difference]: Finished difference Result 76 states and 87 transitions. [2022-01-11 05:24:46,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:24:46,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-01-11 05:24:46,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:46,028 INFO L225 Difference]: With dead ends: 76 [2022-01-11 05:24:46,028 INFO L226 Difference]: Without dead ends: 66 [2022-01-11 05:24:46,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:24:46,029 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:46,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 308 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:24:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-11 05:24:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 63. [2022-01-11 05:24:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 60 states have (on average 1.2333333333333334) internal successors, (74), 62 states have internal predecessors, (74), 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-11 05:24:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 74 transitions. [2022-01-11 05:24:46,034 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 74 transitions. Word has length 13 [2022-01-11 05:24:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:46,034 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 74 transitions. [2022-01-11 05:24:46,034 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:24:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 74 transitions. [2022-01-11 05:24:46,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-11 05:24:46,035 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:46,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:46,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:24:46,035 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:46,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:46,035 INFO L85 PathProgramCache]: Analyzing trace with hash -327283893, now seen corresponding path program 1 times [2022-01-11 05:24:46,035 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:46,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501538166] [2022-01-11 05:24:46,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:46,036 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:46,511 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:46,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:46,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501538166] [2022-01-11 05:24:46,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501538166] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:46,513 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1309276252] [2022-01-11 05:24:46,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:46,513 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:46,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:46,515 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:46,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:24:46,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:46,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-11 05:24:46,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:47,035 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-11 05:24:47,036 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-01-11 05:24:47,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:47,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:47,300 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-01-11 05:24:47,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 37 [2022-01-11 05:24:47,318 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:47,369 INFO L353 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2022-01-11 05:24:47,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 34 treesize of output 59 [2022-01-11 05:24:47,573 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-11 05:24:47,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-11 05:24:47,636 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:47,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:48,230 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| Int)) (or (and (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse0 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616))) (< (+ .cse0 7) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse0 8) 18446744073709551616)))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse1 (+ (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse1 18446744073709551616))) .cse1)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| |c_~#drvlist~0.baseInt|))) is different from false [2022-01-11 05:24:48,519 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| Int)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse0 (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse0 8) 18446744073709551616)))))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse1 (+ (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse1 18446744073709551616))) .cse1))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| |c_~#drvlist~0.baseInt|))) is different from false [2022-01-11 05:24:50,683 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:50,684 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1309276252] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:50,684 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:50,684 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-01-11 05:24:50,684 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405083351] [2022-01-11 05:24:50,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:50,684 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:24:50,685 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:50,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:24:50,685 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=143, Unknown=2, NotChecked=50, Total=240 [2022-01-11 05:24:50,685 INFO L87 Difference]: Start difference. First operand 63 states and 74 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 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-11 05:24:52,758 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#validInt| 3)) (.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (.cse2 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (and (<= (+ |c_~#mutexes~0.baseInt| 1) |c_~#drvlist~0.baseInt|) (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| Int)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse0 (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse0 8) 18446744073709551616)))))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse1 (+ (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse1 18446744073709551616))) .cse1))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| |c_~#drvlist~0.baseInt|))) (<= 0 |c_~#drvlist~0.offsetInt|) (<= |c_~#mutexes~0.offsetInt| 0) (<= 0 |c_~#mutexes~0.offsetInt|) (<= |c_~#drvlist~0.offsetInt| 0) (= (select .cse2 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616)))) |c_~#mutexes~0.baseInt|) (= .cse3 |c_~#drvlist~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| 4)) (= 1 .cse4) (<= |c_~#drvlist~0.offsetInt| |c_~#mutexes~0.offsetInt|) (<= 1 .cse4) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= (select |c_#validInt| 4) 1) (= |c_~#mutexes~0.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse3) (= (select .cse2 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|))) is different from false [2022-01-11 05:24:54,769 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (.cse2 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (and (<= (+ |c_~#mutexes~0.baseInt| 1) |c_~#drvlist~0.baseInt|) (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| Int)) (or (and (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse0 (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse0 8) 18446744073709551616)))))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse1 (+ (mod (+ 18446744073709551608 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse1 18446744073709551616))) .cse1))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| |c_~#drvlist~0.baseInt|))) (<= 0 |c_~#drvlist~0.offsetInt|) (<= |c_~#mutexes~0.offsetInt| 0) (<= 0 |c_~#mutexes~0.offsetInt|) (<= |c_~#drvlist~0.offsetInt| 0) (= (select .cse2 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616)))) |c_~#mutexes~0.baseInt|) (= .cse3 |c_~#drvlist~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| 4)) (<= |c_~#drvlist~0.offsetInt| |c_~#mutexes~0.offsetInt|) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= |c_~#mutexes~0.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse3) (= (select .cse2 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|))) is different from false [2022-01-11 05:24:56,775 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (.cse0 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (and (<= (+ |c_~#mutexes~0.baseInt| 1) |c_~#drvlist~0.baseInt|) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt|)) (<= 0 |c_~#drvlist~0.offsetInt|) (<= |c_~#mutexes~0.offsetInt| 0) (<= 0 |c_~#mutexes~0.offsetInt|) (<= |c_~#drvlist~0.offsetInt| 0) (= (select .cse0 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616)))) |c_~#mutexes~0.baseInt|) (= .cse1 |c_~#drvlist~0.baseInt|) (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| Int)) (or (and (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse2 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616))) (< (+ .cse2 7) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse2 8) 18446744073709551616)))))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_88 (Array Int Int)) (v_ArrVal_87 (Array Int Int)) (v_ArrVal_90 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_88) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_90) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_87) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse3 (+ (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| v_ArrVal_89) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_85) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| v_ArrVal_86) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse3 18446744073709551616))) .cse3)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.baseInt_1| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|)) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_1| |c_~#drvlist~0.baseInt|))) (<= |c_~#drvlist~0.offsetInt| |c_~#mutexes~0.offsetInt|) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= |c_~#mutexes~0.offsetInt| (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (not (= 4 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse1) (= (select .cse0 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|))) is different from false [2022-01-11 05:24:57,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:57,670 INFO L93 Difference]: Finished difference Result 226 states and 263 transitions. [2022-01-11 05:24:57,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:24:57,671 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 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 18 [2022-01-11 05:24:57,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:57,673 INFO L225 Difference]: With dead ends: 226 [2022-01-11 05:24:57,673 INFO L226 Difference]: Without dead ends: 175 [2022-01-11 05:24:57,673 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=66, Invalid=189, Unknown=5, NotChecked=160, Total=420 [2022-01-11 05:24:57,674 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 141 mSDsluCounter, 608 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 361 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:57,675 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 667 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 321 Invalid, 0 Unknown, 361 Unchecked, 0.8s Time] [2022-01-11 05:24:57,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-01-11 05:24:57,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 97. [2022-01-11 05:24:57,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 94 states have (on average 1.2234042553191489) internal successors, (115), 96 states have internal predecessors, (115), 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-11 05:24:57,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 115 transitions. [2022-01-11 05:24:57,683 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 115 transitions. Word has length 18 [2022-01-11 05:24:57,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:57,684 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 115 transitions. [2022-01-11 05:24:57,684 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 15 states have internal predecessors, (45), 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-11 05:24:57,684 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 115 transitions. [2022-01-11 05:24:57,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-11 05:24:57,684 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:57,685 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] [2022-01-11 05:24:57,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:57,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:57,901 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:57,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:57,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1187258192, now seen corresponding path program 1 times [2022-01-11 05:24:57,901 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:57,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159333045] [2022-01-11 05:24:57,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:57,902 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:24:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:58,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:58,042 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:24:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159333045] [2022-01-11 05:24:58,042 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159333045] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:24:58,042 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [554544688] [2022-01-11 05:24:58,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:58,042 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:24:58,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:24:58,044 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:24:58,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:24:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:24:58,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 45 conjunts are in the unsatisfiable core [2022-01-11 05:24:58,177 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:24:58,227 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:24:58,227 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 [2022-01-11 05:24:58,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:24:58,319 INFO L353 Elim1Store]: treesize reduction 52, result has 32.5 percent of original size [2022-01-11 05:24:58,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 67 [2022-01-11 05:24:58,325 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-01-11 05:24:58,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 12 treesize of output 11 [2022-01-11 05:24:58,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2022-01-11 05:24:58,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-01-11 05:24:58,422 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-11 05:24:58,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 33 [2022-01-11 05:24:58,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 16 treesize of output 12 [2022-01-11 05:24:58,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-11 05:24:58,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:58,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:24:58,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:24:58,644 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [554544688] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:24:58,644 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:24:58,644 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-01-11 05:24:58,644 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407196326] [2022-01-11 05:24:58,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:24:58,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-11 05:24:58,645 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:24:58,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-11 05:24:58,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=232, Unknown=0, NotChecked=0, Total=272 [2022-01-11 05:24:58,645 INFO L87 Difference]: Start difference. First operand 97 states and 115 transitions. Second operand has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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-11 05:24:59,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:24:59,631 INFO L93 Difference]: Finished difference Result 236 states and 285 transitions. [2022-01-11 05:24:59,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:24:59,632 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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 20 [2022-01-11 05:24:59,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:24:59,633 INFO L225 Difference]: With dead ends: 236 [2022-01-11 05:24:59,633 INFO L226 Difference]: Without dead ends: 198 [2022-01-11 05:24:59,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=172, Invalid=478, Unknown=0, NotChecked=0, Total=650 [2022-01-11 05:24:59,634 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 1146 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-11 05:24:59,634 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1146 Valid, 236 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-01-11 05:24:59,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-01-11 05:24:59,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 101. [2022-01-11 05:24:59,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 98 states have (on average 1.2142857142857142) internal successors, (119), 100 states have internal predecessors, (119), 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-11 05:24:59,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 119 transitions. [2022-01-11 05:24:59,651 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 119 transitions. Word has length 20 [2022-01-11 05:24:59,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:24:59,651 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 119 transitions. [2022-01-11 05:24:59,651 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.7058823529411766) internal successors, (46), 16 states have internal predecessors, (46), 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-11 05:24:59,651 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 119 transitions. [2022-01-11 05:24:59,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 05:24:59,652 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:24:59,652 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:24:59,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-11 05:24:59,871 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:24:59,872 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:24:59,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:24:59,872 INFO L85 PathProgramCache]: Analyzing trace with hash -159111198, now seen corresponding path program 2 times [2022-01-11 05:24:59,872 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:24:59,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704095437] [2022-01-11 05:24:59,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:24:59,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:00,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:00,674 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:00,674 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:00,674 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704095437] [2022-01-11 05:25:00,675 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704095437] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:00,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76959433] [2022-01-11 05:25:00,675 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:25:00,675 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:00,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:00,676 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:00,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:25:01,359 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:25:01,359 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:25:01,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 108 conjunts are in the unsatisfiable core [2022-01-11 05:25:01,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:01,505 INFO L353 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-01-11 05:25:01,505 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 29 treesize of output 38 [2022-01-11 05:25:01,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:01,775 INFO L353 Elim1Store]: treesize reduction 80, result has 30.4 percent of original size [2022-01-11 05:25:01,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 92 [2022-01-11 05:25:01,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:01,800 INFO L353 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-01-11 05:25:01,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 33 [2022-01-11 05:25:01,810 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2022-01-11 05:25:01,822 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-11 05:25:01,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:01,901 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-11 05:25:01,902 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 34 [2022-01-11 05:25:01,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 9 treesize of output 7 [2022-01-11 05:25:02,018 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-11 05:25:02,019 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 46 [2022-01-11 05:25:02,025 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 29 treesize of output 21 [2022-01-11 05:25:02,249 INFO L353 Elim1Store]: treesize reduction 12, result has 58.6 percent of original size [2022-01-11 05:25:02,250 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 27 treesize of output 31 [2022-01-11 05:25:02,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:02,494 INFO L353 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2022-01-11 05:25:02,494 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 64 treesize of output 80 [2022-01-11 05:25:02,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:02,523 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-01-11 05:25:02,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 38 [2022-01-11 05:25:02,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 19 treesize of output 13 [2022-01-11 05:25:02,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-11 05:25:02,678 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-11 05:25:02,741 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:02,741 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:02,950 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| Int)) (or (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| |c_~#drvlist~0.baseInt|) (and (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_360) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_363) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_362) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_360) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_363) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_362) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_364) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_361) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_359) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* (div (+ 8 .cse0) 18446744073709551616) 18446744073709551616))))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse1 (+ 8 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_364) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_361) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_359) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616)))) (<= (+ |c_~#mutexes~0.offsetInt| (* (div .cse1 18446744073709551616) 18446744073709551616)) .cse1)))))) is different from false [2022-01-11 05:25:03,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| Int)) (or (and (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (<= |c_~#mutexes~0.baseInt| (select (select (store (store (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_360) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_363) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_362) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_360 (Array Int Int)) (v_ArrVal_362 (Array Int Int)) (v_ArrVal_363 (Array Int Int))) (< (select (select (store (store (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_360) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_363) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_362) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse0 (+ 8 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_364) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_361) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_359) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616)))) (<= (+ |c_~#mutexes~0.offsetInt| (* (div .cse0 18446744073709551616) 18446744073709551616)) .cse0))) (forall ((v_ArrVal_359 (Array Int Int)) (v_ArrVal_361 (Array Int Int)) (v_ArrVal_364 (Array Int Int))) (let ((.cse1 (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_364) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_361) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_359) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) 18446744073709551608) 18446744073709551616))) (< (+ 7 .cse1) (+ |c_~#mutexes~0.offsetInt| (* (div (+ 8 .cse1) 18446744073709551616) 18446744073709551616)))))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| |c_~#drvlist~0.baseInt|))) is different from false [2022-01-11 05:25:15,904 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-11 05:25:15,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76959433] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:15,904 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:15,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-01-11 05:25:15,904 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129535019] [2022-01-11 05:25:15,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:15,905 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-11 05:25:15,905 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:15,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-11 05:25:15,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=405, Unknown=9, NotChecked=86, Total=600 [2022-01-11 05:25:15,906 INFO L87 Difference]: Start difference. First operand 101 states and 119 transitions. Second operand has 25 states, 25 states have (on average 2.64) internal successors, (66), 24 states have internal predecessors, (66), 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-11 05:25:47,000 WARN L228 SmtUtils]: Spent 30.87s on a formula simplification. DAG size of input: 117 DAG size of output: 101 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)