/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_NONE.epf -i ../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:36:53,283 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:36:53,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:36:53,318 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:36:53,318 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:36:53,319 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:36:53,320 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:36:53,321 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:36:53,322 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:36:53,323 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:36:53,336 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:36:53,338 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:36:53,338 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:36:53,340 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:36:53,340 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:36:53,341 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:36:53,341 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:36:53,342 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:36:53,343 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:36:53,344 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:36:53,345 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:36:53,349 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:36:53,352 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:36:53,353 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:36:53,357 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:36:53,357 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:36:53,357 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:36:53,358 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:36:53,358 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:36:53,359 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:36:53,359 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:36:53,359 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:36:53,360 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:36:53,360 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:36:53,361 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:36:53,361 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:36:53,361 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:36:53,361 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:36:53,361 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:36:53,362 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:36:53,362 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:36:53,368 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:36:53,384 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:36:53,384 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:36:53,384 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:36:53,384 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:36:53,386 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:36:53,387 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:36:53,387 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:36:53,387 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:36:53,387 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:36:53,387 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:36:53,388 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:36:53,389 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:36:53,389 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:36:53,389 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:36:53,389 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:36:53,389 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:36:53,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:36:53,390 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:36:53,390 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:36:53,390 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:36:53,390 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:36:53,390 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:36:53,391 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:36:53,391 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:36:53,391 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:36:53,391 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:36:53,391 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:36:53,392 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:36:53,392 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:36:53,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:36:53,610 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:36:53,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:36:53,613 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:36:53,613 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:36:53,614 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-2.i [2022-01-10 23:36:53,665 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c632f95b/8936a94675fb4cd8bfedefc7e5b31725/FLAG8906c86a3 [2022-01-10 23:36:53,981 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:36:53,981 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-sets/test_mutex_unbounded-2.i [2022-01-10 23:36:53,989 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c632f95b/8936a94675fb4cd8bfedefc7e5b31725/FLAG8906c86a3 [2022-01-10 23:36:54,391 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c632f95b/8936a94675fb4cd8bfedefc7e5b31725 [2022-01-10 23:36:54,393 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:36:54,407 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:36:54,408 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:36:54,408 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:36:54,411 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:36:54,411 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,412 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c7e683 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54, skipping insertion in model container [2022-01-10 23:36:54,412 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,416 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:36:54,450 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:36:54,692 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-2.i[26271,26284] [2022-01-10 23:36:54,696 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-2.i[26396,26409] [2022-01-10 23:36:54,698 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-2.i[26511,26524] [2022-01-10 23:36:54,709 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:36:54,720 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2022-01-10 23:36:54,725 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:36:54,764 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-2.i[26271,26284] [2022-01-10 23:36:54,765 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-2.i[26396,26409] [2022-01-10 23:36:54,765 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-2.i[26511,26524] [2022-01-10 23:36:54,786 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:36:54,787 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:36:54,819 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-2.i[26271,26284] [2022-01-10 23:36:54,836 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-2.i[26396,26409] [2022-01-10 23:36:54,837 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-2.i[26511,26524] [2022-01-10 23:36:54,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:36:54,865 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:36:54,866 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54 WrapperNode [2022-01-10 23:36:54,866 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:36:54,866 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:36:54,866 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:36:54,867 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:36:54,881 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,892 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,912 INFO L137 Inliner]: procedures = 143, calls = 63, calls flagged for inlining = 25, calls inlined = 26, statements flattened = 270 [2022-01-10 23:36:54,912 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:36:54,913 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:36:54,913 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:36:54,913 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:36:54,918 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,918 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,922 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,922 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,942 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,955 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,956 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,959 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:36:54,960 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:36:54,960 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:36:54,960 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:36:54,968 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (1/1) ... [2022-01-10 23:36:54,973 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:36:54,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:36:54,995 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:36:54,998 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:36:55,035 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:36:55,036 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:36:55,190 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:36:55,191 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:36:55,700 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:36:55,705 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:36:55,705 INFO L299 CfgBuilder]: Removed 7 assume(true) statements. [2022-01-10 23:36:55,706 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:36:55 BoogieIcfgContainer [2022-01-10 23:36:55,707 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:36:55,707 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:36:55,707 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:36:55,709 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:36:55,711 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:36:55" (1/1) ... [2022-01-10 23:36:55,810 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:36:55 BasicIcfg [2022-01-10 23:36:55,810 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:36:55,811 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:36:55,811 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:36:55,813 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:36:55,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:36:54" (1/4) ... [2022-01-10 23:36:55,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:36:55, skipping insertion in model container [2022-01-10 23:36:55,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:36:54" (2/4) ... [2022-01-10 23:36:55,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:36:55, skipping insertion in model container [2022-01-10 23:36:55,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:36:55" (3/4) ... [2022-01-10 23:36:55,814 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6d664f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:36:55, skipping insertion in model container [2022-01-10 23:36:55,814 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:36:55" (4/4) ... [2022-01-10 23:36:55,815 INFO L111 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.iTransformedIcfg [2022-01-10 23:36:55,818 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:36:55,818 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-01-10 23:36:55,843 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:36:55,846 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:36:55,846 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-01-10 23:36:55,854 INFO L276 IsEmpty]: Start isEmpty. Operand has 67 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 66 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:36:55,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 23:36:55,858 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:36:55,858 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:36:55,858 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:36:55,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:36:55,864 INFO L85 PathProgramCache]: Analyzing trace with hash -486737594, now seen corresponding path program 1 times [2022-01-10 23:36:55,868 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:36:55,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162531825] [2022-01-10 23:36:55,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:55,870 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:36:55,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:56,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:36:56,037 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:36:56,038 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162531825] [2022-01-10 23:36:56,038 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162531825] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:36:56,038 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:36:56,038 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:36:56,039 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514914571] [2022-01-10 23:36:56,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:36:56,045 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:36:56,045 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:36:56,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:36:56,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:36:56,069 INFO L87 Difference]: Start difference. First operand has 67 states, 63 states have (on average 1.4285714285714286) internal successors, (90), 66 states have internal predecessors, (90), 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-10 23:36:56,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:36:56,090 INFO L93 Difference]: Finished difference Result 131 states and 177 transitions. [2022-01-10 23:36:56,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:36:56,091 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-10 23:36:56,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:36:56,097 INFO L225 Difference]: With dead ends: 131 [2022-01-10 23:36:56,097 INFO L226 Difference]: Without dead ends: 62 [2022-01-10 23:36:56,104 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:36:56,107 INFO L933 BasicCegarLoop]: 78 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, 78 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:36:56,107 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:36:56,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-01-10 23:36:56,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2022-01-10 23:36:56,129 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-10 23:36:56,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 73 transitions. [2022-01-10 23:36:56,133 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 73 transitions. Word has length 11 [2022-01-10 23:36:56,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:36:56,133 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 73 transitions. [2022-01-10 23:36:56,133 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-10 23:36:56,134 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 73 transitions. [2022-01-10 23:36:56,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 23:36:56,135 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:36:56,135 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:36:56,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:36:56,135 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:36:56,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:36:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 1256996262, now seen corresponding path program 1 times [2022-01-10 23:36:56,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:36:56,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426857909] [2022-01-10 23:36:56,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:56,139 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:36:56,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:56,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:36:56,260 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:36:56,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426857909] [2022-01-10 23:36:56,261 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426857909] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:36:56,261 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:36:56,261 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 23:36:56,264 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919933330] [2022-01-10 23:36:56,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:36:56,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:36:56,265 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:36:56,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:36:56,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:36:56,266 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), 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-10 23:36:56,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:36:56,332 INFO L93 Difference]: Finished difference Result 101 states and 116 transitions. [2022-01-10 23:36:56,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:36:56,333 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-10 23:36:56,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:36:56,346 INFO L225 Difference]: With dead ends: 101 [2022-01-10 23:36:56,346 INFO L226 Difference]: Without dead ends: 99 [2022-01-10 23:36:56,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:36:56,348 INFO L933 BasicCegarLoop]: 79 mSDtfsCounter, 37 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 216 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:36:56,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 216 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:36:56,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-01-10 23:36:56,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 64. [2022-01-10 23:36:56,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 61 states have (on average 1.2295081967213115) internal successors, (75), 63 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:36:56,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 75 transitions. [2022-01-10 23:36:56,359 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 75 transitions. Word has length 11 [2022-01-10 23:36:56,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:36:56,359 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 75 transitions. [2022-01-10 23:36:56,359 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-10 23:36:56,359 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 75 transitions. [2022-01-10 23:36:56,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 23:36:56,360 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:36:56,360 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:36:56,360 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:36:56,360 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:36:56,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:36:56,360 INFO L85 PathProgramCache]: Analyzing trace with hash 1257949574, now seen corresponding path program 1 times [2022-01-10 23:36:56,361 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:36:56,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902751438] [2022-01-10 23:36:56,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:56,375 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:36:56,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:56,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:36:56,562 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:36:56,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902751438] [2022-01-10 23:36:56,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902751438] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:36:56,563 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:36:56,563 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:36:56,563 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506305541] [2022-01-10 23:36:56,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:36:56,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 23:36:56,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:36:56,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 23:36:56,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 23:36:56,567 INFO L87 Difference]: Start difference. First operand 64 states and 75 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-10 23:36:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:36:56,773 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-01-10 23:36:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 23:36:56,773 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-10 23:36:56,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:36:56,774 INFO L225 Difference]: With dead ends: 131 [2022-01-10 23:36:56,774 INFO L226 Difference]: Without dead ends: 78 [2022-01-10 23:36:56,774 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 23:36:56,775 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 18 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:36:56,775 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 162 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:36:56,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-01-10 23:36:56,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 69. [2022-01-10 23:36:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 66 states have (on average 1.2272727272727273) internal successors, (81), 68 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:36:56,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 81 transitions. [2022-01-10 23:36:56,780 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 81 transitions. Word has length 11 [2022-01-10 23:36:56,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:36:56,780 INFO L470 AbstractCegarLoop]: Abstraction has 69 states and 81 transitions. [2022-01-10 23:36:56,780 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-10 23:36:56,780 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 81 transitions. [2022-01-10 23:36:56,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-01-10 23:36:56,780 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:36:56,780 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:36:56,780 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:36:56,781 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:36:56,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:36:56,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1803680939, now seen corresponding path program 1 times [2022-01-10 23:36:56,781 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:36:56,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089332136] [2022-01-10 23:36:56,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:56,781 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:36:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:56,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:36:56,935 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:36:56,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089332136] [2022-01-10 23:36:56,936 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089332136] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:36:56,936 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:36:56,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-10 23:36:56,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606540306] [2022-01-10 23:36:56,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:36:56,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:36:56,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:36:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:36:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:36:56,937 INFO L87 Difference]: Start difference. First operand 69 states and 81 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-10 23:36:57,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:36:57,208 INFO L93 Difference]: Finished difference Result 78 states and 89 transitions. [2022-01-10 23:36:57,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:36:57,208 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-10 23:36:57,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:36:57,209 INFO L225 Difference]: With dead ends: 78 [2022-01-10 23:36:57,209 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 23:36:57,209 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-10 23:36:57,210 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 9 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:36:57,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 317 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:36:57,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 23:36:57,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2022-01-10 23:36:57,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 62 states have (on average 1.2258064516129032) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:36:57,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-01-10 23:36:57,213 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 13 [2022-01-10 23:36:57,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:36:57,213 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-01-10 23:36:57,213 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-10 23:36:57,214 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-01-10 23:36:57,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:36:57,214 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:36:57,214 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-10 23:36:57,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:36:57,214 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:36:57,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:36:57,215 INFO L85 PathProgramCache]: Analyzing trace with hash 2137100235, now seen corresponding path program 1 times [2022-01-10 23:36:57,215 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:36:57,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039451316] [2022-01-10 23:36:57,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:57,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:36:57,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:57,843 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-10 23:36:57,843 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:36:57,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039451316] [2022-01-10 23:36:57,843 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039451316] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:36:57,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1087596678] [2022-01-10 23:36:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:36:57,844 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:36:57,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:36:57,845 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-10 23:36:57,846 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-10 23:36:58,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:36:58,098 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-10 23:36:58,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:36:58,263 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 23:36:58,264 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-10 23:36:58,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:36:58,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:36:58,470 INFO L353 Elim1Store]: treesize reduction 33, result has 40.0 percent of original size [2022-01-10 23:36:58,470 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-10 23:36:58,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:36:58,525 INFO L353 Elim1Store]: treesize reduction 70, result has 35.8 percent of original size [2022-01-10 23:36:58,526 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-10 23:36:58,667 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-10 23:36:58,670 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-10 23:36:58,712 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-10 23:36:58,712 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:36:59,211 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-10 23:36:59,443 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-10 23:37:01,315 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-10 23:37:01,315 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1087596678] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:01,316 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:01,316 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-01-10 23:37:01,316 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1067561145] [2022-01-10 23:37:01,316 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:01,316 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-10 23:37:01,316 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:01,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-10 23:37:01,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=141, Unknown=2, NotChecked=50, Total=240 [2022-01-10 23:37:01,317 INFO L87 Difference]: Start difference. First operand 65 states and 76 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-10 23:37:03,390 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|)) (.cse6 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (let ((.cse1 (select .cse6 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616))))) (.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (.cse4 (select .cse5 |c_~#drvlist~0.offsetInt|))) (and (= |c_~#drvlist~0.offsetInt| .cse0) (<= |c_~#mutexes~0.baseInt| .cse1) (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 ((.cse2 (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 .cse2) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse2 8) 18446744073709551616)))))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse3 (+ (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 .cse3 18446744073709551616))) .cse3))) (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) (<= .cse1 |c_~#mutexes~0.baseInt|) (= .cse4 |c_~#drvlist~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| 4)) (= 1 (select |c_#validInt| 3)) (<= |c_~#drvlist~0.baseInt| 4) (<= 4 |c_~#drvlist~0.baseInt|) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= |c_~#mutexes~0.offsetInt| |c_~#drvlist~0.offsetInt|) (= (select |c_#validInt| 4) 1) (= (select .cse5 (+ |c_~#drvlist~0.offsetInt| (* (div (+ |c_~#drvlist~0.offsetInt| 8) 18446744073709551616) (- 18446744073709551616)) 8)) |c_~#drvlist~0.baseInt|) (= |c_~#mutexes~0.offsetInt| .cse0) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse4) (= (select .cse6 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|)))) is different from false [2022-01-10 23:37:05,398 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|)) (.cse6 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (let ((.cse1 (select .cse6 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616))))) (.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (.cse4 (select .cse5 |c_~#drvlist~0.offsetInt|))) (and (= |c_~#drvlist~0.offsetInt| .cse0) (<= |c_~#mutexes~0.baseInt| .cse1) (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 ((.cse2 (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 .cse2) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse2 8) 18446744073709551616)))))) (forall ((v_ArrVal_85 (Array Int Int)) (v_ArrVal_89 (Array Int Int)) (v_ArrVal_86 (Array Int Int))) (let ((.cse3 (+ (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 .cse3 18446744073709551616))) .cse3))) (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) (<= .cse1 |c_~#mutexes~0.baseInt|) (= .cse4 |c_~#drvlist~0.baseInt|) (not (= |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| 4)) (<= |c_~#drvlist~0.baseInt| 4) (<= 4 |c_~#drvlist~0.baseInt|) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= |c_~#mutexes~0.offsetInt| |c_~#drvlist~0.offsetInt|) (= (select .cse5 (+ |c_~#drvlist~0.offsetInt| (* (div (+ |c_~#drvlist~0.offsetInt| 8) 18446744073709551616) (- 18446744073709551616)) 8)) |c_~#drvlist~0.baseInt|) (= |c_~#mutexes~0.offsetInt| .cse0) (not (= 3 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse4) (= (select .cse6 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|)))) is different from false [2022-01-10 23:37:07,405 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|)) (.cse6 (select |c_#memory_$Pointer$.baseInt| |c_~#mutexes~0.baseInt|))) (let ((.cse1 (select .cse6 (+ |c_~#mutexes~0.offsetInt| 8 (* (- 18446744073709551616) (div (+ |c_~#mutexes~0.offsetInt| 8) 18446744073709551616))))) (.cse0 (select (select |c_#memory_$Pointer$.offsetInt| |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) (.cse2 (select .cse5 |c_~#drvlist~0.offsetInt|))) (and (= |c_~#drvlist~0.offsetInt| .cse0) (<= |c_~#mutexes~0.baseInt| .cse1) (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) (<= .cse1 |c_~#mutexes~0.baseInt|) (= .cse2 |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 ((.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))) (< (+ .cse3 7) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ .cse3 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 ((.cse4 (+ (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 .cse4 18446744073709551616))) .cse4)))) (< |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.baseInt| 4) (<= 4 |c_~#drvlist~0.baseInt|) (= 3 |c_~#mutexes~0.baseInt|) (= |c_~#drvlist~0.baseInt| 4) (= |c_~#mutexes~0.offsetInt| |c_~#drvlist~0.offsetInt|) (= (select .cse5 (+ |c_~#drvlist~0.offsetInt| (* (div (+ |c_~#drvlist~0.offsetInt| 8) 18446744073709551616) (- 18446744073709551616)) 8)) |c_~#drvlist~0.baseInt|) (= |c_~#mutexes~0.offsetInt| .cse0) (not (= 4 |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt|)) (<= |c_~#drvlist~0.baseInt| .cse2) (= (select .cse6 |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|)))) is different from false [2022-01-10 23:37:08,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:08,206 INFO L93 Difference]: Finished difference Result 231 states and 267 transitions. [2022-01-10 23:37:08,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 23:37:08,206 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-10 23:37:08,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:08,208 INFO L225 Difference]: With dead ends: 231 [2022-01-10 23:37:08,208 INFO L226 Difference]: Without dead ends: 178 [2022-01-10 23:37:08,209 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=79, Invalid=208, Unknown=5, NotChecked=170, Total=462 [2022-01-10 23:37:08,209 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 180 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 512 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 215 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:08,209 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 551 Invalid, 512 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 280 Invalid, 0 Unknown, 215 Unchecked, 0.7s Time] [2022-01-10 23:37:08,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-01-10 23:37:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 93. [2022-01-10 23:37:08,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 90 states have (on average 1.2222222222222223) internal successors, (110), 92 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 110 transitions. [2022-01-10 23:37:08,222 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 110 transitions. Word has length 18 [2022-01-10 23:37:08,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:08,223 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 110 transitions. [2022-01-10 23:37:08,223 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-10 23:37:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 110 transitions. [2022-01-10 23:37:08,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-01-10 23:37:08,224 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:08,224 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-10 23:37:08,256 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-10 23:37:08,441 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-10 23:37:08,441 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:08,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:08,442 INFO L85 PathProgramCache]: Analyzing trace with hash 558908848, now seen corresponding path program 1 times [2022-01-10 23:37:08,442 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:08,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551927083] [2022-01-10 23:37:08,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:08,442 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:08,577 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-10 23:37:08,577 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:08,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551927083] [2022-01-10 23:37:08,578 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551927083] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:08,578 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582443778] [2022-01-10 23:37:08,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:08,578 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:08,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:08,596 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-10 23:37:08,597 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-10 23:37:08,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:08,727 INFO L263 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 82 conjunts are in the unsatisfiable core [2022-01-10 23:37:08,730 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:08,978 INFO L353 Elim1Store]: treesize reduction 231, result has 19.2 percent of original size [2022-01-10 23:37:08,978 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 9 case distinctions, treesize of input 302 treesize of output 229 [2022-01-10 23:37:08,986 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 149 treesize of output 126 [2022-01-10 23:37:08,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:08,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 35 [2022-01-10 23:37:08,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:09,006 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:09,007 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 194 treesize of output 173 [2022-01-10 23:37:09,014 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:09,032 INFO L353 Elim1Store]: treesize reduction 26, result has 49.0 percent of original size [2022-01-10 23:37:09,032 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 35 [2022-01-10 23:37:09,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-10 23:37:09,048 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2022-01-10 23:37:09,061 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 5 treesize of output 3 [2022-01-10 23:37:09,096 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 147 treesize of output 113 [2022-01-10 23:37:09,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:09,124 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:09,125 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 23:37:09,128 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-10 23:37:09,214 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-10 23:37:09,218 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-10 23:37:09,249 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 26 treesize of output 14 [2022-01-10 23:37:09,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:09,315 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-01-10 23:37:09,319 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 20 treesize of output 14 [2022-01-10 23:37:09,338 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 5 treesize of output 3 [2022-01-10 23:37:09,729 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-10 23:37:09,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:09,858 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:09,858 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 24 [2022-01-10 23:37:09,865 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_181 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_ldv_list_add_#in~new#1.offsetInt_2| Int) (|v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.offsetInt_2| Int)) (= |c_~#mutexes~0.offsetInt| (select (select (store (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|))) (store |c_#memory_$Pointer$.offsetInt| .cse0 (store (select |c_#memory_$Pointer$.offsetInt| .cse0) (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~next#1.offsetInt_2|) 18446744073709551616) |v_ULTIMATE.start_ULTIMATE.start_ldv_list_add_#in~new#1.offsetInt_2|))) |c_~#drvlist~0.baseInt| v_ArrVal_181) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_182 (Array Int Int))) (or (not (= (select v_arrayElimArr_5 |c_~#drvlist~0.offsetInt|) |c_~#drvlist~0.baseInt|)) (= (select (select (store (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_~#drvlist~0.baseInt|) |c_~#drvlist~0.offsetInt|) v_ArrVal_182) |c_~#drvlist~0.baseInt| v_arrayElimArr_5) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) |c_~#mutexes~0.baseInt|)))) is different from false [2022-01-10 23:37:09,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-01-10 23:37:09,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582443778] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:09,922 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:09,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 17 [2022-01-10 23:37:09,923 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816123876] [2022-01-10 23:37:09,923 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:09,923 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 23:37:09,923 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:09,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 23:37:09,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=228, Unknown=1, NotChecked=30, Total=306 [2022-01-10 23:37:09,924 INFO L87 Difference]: Start difference. First operand 93 states and 110 transitions. Second operand has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:12,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:12,423 INFO L93 Difference]: Finished difference Result 204 states and 241 transitions. [2022-01-10 23:37:12,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 23:37:12,425 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 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-10 23:37:12,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:12,427 INFO L225 Difference]: With dead ends: 204 [2022-01-10 23:37:12,427 INFO L226 Difference]: Without dead ends: 166 [2022-01-10 23:37:12,429 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 26 SyntacticMatches, 5 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=162, Invalid=711, Unknown=1, NotChecked=56, Total=930 [2022-01-10 23:37:12,432 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 377 mSDsluCounter, 947 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 377 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:12,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [377 Valid, 1060 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 291 Invalid, 0 Unknown, 89 Unchecked, 1.0s Time] [2022-01-10 23:37:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-01-10 23:37:12,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 81. [2022-01-10 23:37:12,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 78 states have (on average 1.1923076923076923) internal successors, (93), 80 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:12,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 93 transitions. [2022-01-10 23:37:12,444 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 93 transitions. Word has length 20 [2022-01-10 23:37:12,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:12,444 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 93 transitions. [2022-01-10 23:37:12,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.0555555555555554) internal successors, (55), 17 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:37:12,445 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 93 transitions. [2022-01-10 23:37:12,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 23:37:12,445 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:12,445 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-10 23:37:12,470 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-10 23:37:12,670 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-10 23:37:12,670 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:12,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:12,671 INFO L85 PathProgramCache]: Analyzing trace with hash -727637530, now seen corresponding path program 2 times [2022-01-10 23:37:12,671 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:12,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364565733] [2022-01-10 23:37:12,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:12,671 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:13,495 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-10 23:37:13,495 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:13,495 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364565733] [2022-01-10 23:37:13,495 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364565733] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:13,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1238490861] [2022-01-10 23:37:13,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 23:37:13,496 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:13,496 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:13,503 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-10 23:37:13,503 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-10 23:37:14,337 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 23:37:14,337 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 23:37:14,343 INFO L263 TraceCheckSpWp]: Trace formula consists of 746 conjuncts, 120 conjunts are in the unsatisfiable core [2022-01-10 23:37:14,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:14,530 INFO L353 Elim1Store]: treesize reduction 72, result has 33.9 percent of original size [2022-01-10 23:37:14,531 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 44 treesize of output 65 [2022-01-10 23:37:14,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:14,823 INFO L353 Elim1Store]: treesize reduction 104, result has 9.6 percent of original size [2022-01-10 23:37:14,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 89 treesize of output 86 [2022-01-10 23:37:14,831 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 39 [2022-01-10 23:37:14,837 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 0 case distinctions, treesize of input 24 treesize of output 25 [2022-01-10 23:37:14,844 INFO L353 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-01-10 23:37:14,844 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 91 treesize of output 70 [2022-01-10 23:37:14,848 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 53 treesize of output 37 [2022-01-10 23:37:14,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 5 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-10 23:37:15,134 INFO L353 Elim1Store]: treesize reduction 20, result has 55.6 percent of original size [2022-01-10 23:37:15,134 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 11 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 42 treesize of output 48 [2022-01-10 23:37:15,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:15,440 INFO L353 Elim1Store]: treesize reduction 76, result has 30.3 percent of original size [2022-01-10 23:37:15,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 95 treesize of output 103 [2022-01-10 23:37:15,450 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:15,467 INFO L353 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2022-01-10 23:37:15,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 11 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-10 23:37:15,500 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 42 treesize of output 28 [2022-01-10 23:37:15,585 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-10 23:37:15,589 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-10 23:37:15,641 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-10 23:37:15,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:15,811 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_369 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_368 (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_368) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_371) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_369) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (mod (+ 18446744073709551608 (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_370) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_367) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_372) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div (+ 8 .cse0) 18446744073709551616)))))) (forall ((v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse1 (+ 8 (mod (+ 18446744073709551608 (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_370) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_367) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_372) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616)))) (<= (+ |c_~#mutexes~0.offsetInt| (* 18446744073709551616 (div .cse1 18446744073709551616))) .cse1))) (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_368 (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_368) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_#res#1.baseInt| v_ArrVal_371) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_369) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)))) (< |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| |c_~#drvlist~0.baseInt|))) is different from false [2022-01-10 23:37:15,859 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_370 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse0 (mod (+ 18446744073709551608 (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_370) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_367) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_372) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616))) (< (+ 7 .cse0) (+ |c_~#mutexes~0.offsetInt| (* (div (+ .cse0 8) 18446744073709551616) 18446744073709551616))))) (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_368 (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_368) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_371) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_369) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|) (+ |c_~#mutexes~0.baseInt| 1))) (forall ((v_ArrVal_369 (Array Int Int)) (v_ArrVal_371 (Array Int Int)) (v_ArrVal_368 (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_368) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_371) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_369) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|))) (forall ((v_ArrVal_370 (Array Int Int)) (v_ArrVal_372 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse1 (+ (mod (+ 18446744073709551608 (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_370) |c_ULTIMATE.start_ULTIMATE.start_ldv_successful_malloc_~ptr~0#1.baseInt| v_ArrVal_367) |v_ULTIMATE.start_ULTIMATE.start___ldv_list_add_~prev#1.baseInt_3| v_ArrVal_372) |c_~#mutexes~0.baseInt|) |c_~#mutexes~0.offsetInt|)) 18446744073709551616) 8))) (<= (+ |c_~#mutexes~0.offsetInt| (* (div .cse1 18446744073709551616) 18446744073709551616)) .cse1)))))) is different from false [2022-01-10 23:37:36,289 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 1 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-10 23:37:36,289 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1238490861] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 23:37:36,290 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 23:37:36,290 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 24 [2022-01-10 23:37:36,290 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235645315] [2022-01-10 23:37:36,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 23:37:36,290 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-01-10 23:37:36,290 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-01-10 23:37:36,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=413, Unknown=8, NotChecked=86, Total=600 [2022-01-10 23:37:36,291 INFO L87 Difference]: Start difference. First operand 81 states and 93 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-10 23:37:45,760 WARN L228 SmtUtils]: Spent 8.95s on a formula simplification. DAG size of input: 121 DAG size of output: 103 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-01-10 23:37:52,983 WARN L228 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 119 DAG size of output: 104 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)