/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 13:55:06,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:55:06,946 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:55:06,981 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:55:06,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:55:06,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:55:06,983 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:55:06,984 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:55:06,985 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:55:06,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:55:06,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:55:06,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:55:06,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:55:06,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:55:06,995 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:55:06,996 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:55:06,996 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:55:06,998 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:55:07,000 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:55:07,001 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:55:07,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:55:07,004 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:55:07,005 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:55:07,005 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:55:07,007 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:55:07,007 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:55:07,007 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:55:07,008 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:55:07,008 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:55:07,009 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:55:07,009 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:55:07,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:55:07,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:55:07,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:55:07,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:55:07,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:55:07,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:55:07,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:55:07,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:55:07,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:55:07,012 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:55:07,018 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 13:55:07,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:55:07,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:55:07,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:55:07,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:55:07,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:55:07,048 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:55:07,048 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:55:07,048 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:55:07,048 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:55:07,048 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:55:07,048 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:55:07,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:55:07,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:55:07,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:55:07,050 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:55:07,051 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 13:55:07,335 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:55:07,348 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:55:07,350 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:55:07,350 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:55:07,360 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:55:07,361 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-12-12 13:55:08,389 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:55:08,563 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:55:08,563 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c [2022-12-12 13:55:08,568 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159028f80/9f6bd17e671c4ccfa40c9c3bff0a8aa1/FLAGa060262cd [2022-12-12 13:55:08,582 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/159028f80/9f6bd17e671c4ccfa40c9c3bff0a8aa1 [2022-12-12 13:55:08,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:55:08,590 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:55:08,593 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:55:08,594 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:55:08,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:55:08,596 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,597 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5dfff462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08, skipping insertion in model container [2022-12-12 13:55:08,597 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,602 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:55:08,621 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:55:08,773 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2022-12-12 13:55:08,784 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:55:08,793 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:55:08,822 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-5.wvr.c[2644,2657] [2022-12-12 13:55:08,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:55:08,842 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:55:08,843 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08 WrapperNode [2022-12-12 13:55:08,843 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:55:08,845 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:55:08,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:55:08,846 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:55:08,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,895 INFO L138 Inliner]: procedures = 24, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 164 [2022-12-12 13:55:08,895 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:55:08,897 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:55:08,897 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:55:08,897 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:55:08,903 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,915 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,916 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,923 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,927 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,928 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,929 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:55:08,930 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:55:08,930 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:55:08,930 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:55:08,931 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (1/1) ... [2022-12-12 13:55:08,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:55:08,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:55:08,993 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-12-12 13:55:09,028 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-12-12 13:55:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:55:09,050 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:55:09,050 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:55:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:55:09,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:55:09,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:55:09,052 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 13:55:09,154 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:55:09,155 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:55:09,484 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:55:09,490 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:55:09,490 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 13:55:09,492 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:55:09 BoogieIcfgContainer [2022-12-12 13:55:09,492 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:55:09,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:55:09,494 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:55:09,496 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:55:09,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:55:08" (1/3) ... [2022-12-12 13:55:09,496 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da051cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:55:09, skipping insertion in model container [2022-12-12 13:55:09,496 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:55:08" (2/3) ... [2022-12-12 13:55:09,497 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@da051cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:55:09, skipping insertion in model container [2022-12-12 13:55:09,497 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:55:09" (3/3) ... [2022-12-12 13:55:09,497 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-5.wvr.c [2022-12-12 13:55:09,509 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:55:09,509 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:55:09,509 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:55:09,583 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 13:55:09,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 193 transitions, 402 flow [2022-12-12 13:55:09,687 INFO L130 PetriNetUnfolder]: 17/191 cut-off events. [2022-12-12 13:55:09,687 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:55:09,694 INFO L83 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 191 events. 17/191 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 163 event pairs, 0 based on Foata normal form. 0/173 useless extension candidates. Maximal degree in co-relation 101. Up to 2 conditions per place. [2022-12-12 13:55:09,695 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 193 transitions, 402 flow [2022-12-12 13:55:09,702 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 173 places, 183 transitions, 378 flow [2022-12-12 13:55:09,709 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:55:09,713 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@32814b8a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:55:09,713 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 13:55:09,742 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-12 13:55:09,742 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:55:09,742 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:09,743 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:09,744 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:09,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:09,747 INFO L85 PathProgramCache]: Analyzing trace with hash 724594817, now seen corresponding path program 1 times [2022-12-12 13:55:09,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:09,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090366826] [2022-12-12 13:55:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:09,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:55:10,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:10,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090366826] [2022-12-12 13:55:10,303 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090366826] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:10,303 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:10,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 13:55:10,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516429735] [2022-12-12 13:55:10,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:10,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 13:55:10,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:10,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 13:55:10,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 13:55:10,343 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 131 out of 193 [2022-12-12 13:55:10,407 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 173 places, 183 transitions, 378 flow. Second operand has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 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-12-12 13:55:10,408 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:10,408 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 131 of 193 [2022-12-12 13:55:10,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:10,623 INFO L130 PetriNetUnfolder]: 28/360 cut-off events. [2022-12-12 13:55:10,623 INFO L131 PetriNetUnfolder]: For 46/47 co-relation queries the response was YES. [2022-12-12 13:55:10,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 471 conditions, 360 events. 28/360 cut-off events. For 46/47 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 930 event pairs, 11 based on Foata normal form. 39/361 useless extension candidates. Maximal degree in co-relation 311. Up to 74 conditions per place. [2022-12-12 13:55:10,631 INFO L137 encePairwiseOnDemand]: 171/193 looper letters, 39 selfloop transitions, 7 changer transitions 5/173 dead transitions. [2022-12-12 13:55:10,632 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 173 transitions, 460 flow [2022-12-12 13:55:10,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:55:10,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:55:10,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1115 transitions. [2022-12-12 13:55:10,649 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7221502590673575 [2022-12-12 13:55:10,653 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 7 predicate places. [2022-12-12 13:55:10,654 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 173 transitions, 460 flow [2022-12-12 13:55:10,659 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 171 places, 173 transitions, 389 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-12 13:55:10,660 INFO L495 AbstractCegarLoop]: Abstraction has has 171 places, 173 transitions, 389 flow [2022-12-12 13:55:10,661 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 135.0) internal successors, (1080), 8 states have internal predecessors, (1080), 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-12-12 13:55:10,661 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:10,662 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:10,662 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:55:10,662 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:10,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:10,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2009187828, now seen corresponding path program 1 times [2022-12-12 13:55:10,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:10,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213786296] [2022-12-12 13:55:10,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:10,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:10,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:10,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:10,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:10,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213786296] [2022-12-12 13:55:10,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213786296] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:10,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:10,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:55:10,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900489820] [2022-12-12 13:55:10,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:10,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:55:10,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:10,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:55:10,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:55:10,931 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 193 [2022-12-12 13:55:10,932 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 171 places, 173 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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-12-12 13:55:10,932 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:10,932 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 193 [2022-12-12 13:55:10,933 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:11,162 INFO L130 PetriNetUnfolder]: 145/861 cut-off events. [2022-12-12 13:55:11,162 INFO L131 PetriNetUnfolder]: For 172/182 co-relation queries the response was YES. [2022-12-12 13:55:11,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1334 conditions, 861 events. 145/861 cut-off events. For 172/182 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 4814 event pairs, 47 based on Foata normal form. 0/787 useless extension candidates. Maximal degree in co-relation 826. Up to 160 conditions per place. [2022-12-12 13:55:11,167 INFO L137 encePairwiseOnDemand]: 181/193 looper letters, 71 selfloop transitions, 5 changer transitions 11/211 dead transitions. [2022-12-12 13:55:11,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 179 places, 211 transitions, 670 flow [2022-12-12 13:55:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 13:55:11,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 13:55:11,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1249 transitions. [2022-12-12 13:55:11,169 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.719055843408175 [2022-12-12 13:55:11,170 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 6 predicate places. [2022-12-12 13:55:11,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 179 places, 211 transitions, 670 flow [2022-12-12 13:55:11,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 211 transitions, 636 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-12 13:55:11,173 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 211 transitions, 636 flow [2022-12-12 13:55:11,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.33333333333334) internal successors, (800), 6 states have internal predecessors, (800), 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-12-12 13:55:11,174 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:11,174 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:11,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 13:55:11,174 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash -2094109110, now seen corresponding path program 1 times [2022-12-12 13:55:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:11,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324635925] [2022-12-12 13:55:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:11,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:11,320 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:11,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324635925] [2022-12-12 13:55:11,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324635925] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:55:11,320 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791881545] [2022-12-12 13:55:11,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:11,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:55:11,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:55:11,323 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-12-12 13:55:11,360 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-12-12 13:55:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:11,441 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 13:55:11,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:55:11,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:11,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:55:11,583 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:11,583 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791881545] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:55:11,584 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:55:11,584 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 5] total 7 [2022-12-12 13:55:11,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145869665] [2022-12-12 13:55:11,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:11,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:55:11,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:11,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:55:11,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2022-12-12 13:55:11,585 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 193 [2022-12-12 13:55:11,586 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 211 transitions, 636 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-12-12 13:55:11,586 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:11,586 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 193 [2022-12-12 13:55:11,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:11,719 INFO L130 PetriNetUnfolder]: 246/1292 cut-off events. [2022-12-12 13:55:11,719 INFO L131 PetriNetUnfolder]: For 490/498 co-relation queries the response was YES. [2022-12-12 13:55:11,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2226 conditions, 1292 events. 246/1292 cut-off events. For 490/498 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 8236 event pairs, 59 based on Foata normal form. 0/1159 useless extension candidates. Maximal degree in co-relation 1507. Up to 224 conditions per place. [2022-12-12 13:55:11,725 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 33 selfloop transitions, 5 changer transitions 11/223 dead transitions. [2022-12-12 13:55:11,725 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 182 places, 223 transitions, 758 flow [2022-12-12 13:55:11,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:55:11,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:55:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 659 transitions. [2022-12-12 13:55:11,727 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8536269430051814 [2022-12-12 13:55:11,727 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 9 predicate places. [2022-12-12 13:55:11,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 182 places, 223 transitions, 758 flow [2022-12-12 13:55:11,730 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 182 places, 223 transitions, 750 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 13:55:11,730 INFO L495 AbstractCegarLoop]: Abstraction has has 182 places, 223 transitions, 750 flow [2022-12-12 13:55:11,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-12-12 13:55:11,731 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:11,731 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:11,742 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-12-12 13:55:11,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:55:11,942 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:11,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:11,943 INFO L85 PathProgramCache]: Analyzing trace with hash -304269246, now seen corresponding path program 2 times [2022-12-12 13:55:11,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:11,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206490181] [2022-12-12 13:55:11,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:11,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:11,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:12,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:12,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:12,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206490181] [2022-12-12 13:55:12,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [206490181] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:12,043 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:12,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:55:12,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439265769] [2022-12-12 13:55:12,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:12,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:55:12,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:12,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:55:12,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:55:12,045 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2022-12-12 13:55:12,046 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 182 places, 223 transitions, 750 flow. Second operand has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 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-12-12 13:55:12,046 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:12,046 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2022-12-12 13:55:12,046 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:12,269 INFO L130 PetriNetUnfolder]: 363/1737 cut-off events. [2022-12-12 13:55:12,269 INFO L131 PetriNetUnfolder]: For 1025/1119 co-relation queries the response was YES. [2022-12-12 13:55:12,271 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3427 conditions, 1737 events. 363/1737 cut-off events. For 1025/1119 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11699 event pairs, 119 based on Foata normal form. 10/1571 useless extension candidates. Maximal degree in co-relation 2465. Up to 285 conditions per place. [2022-12-12 13:55:12,276 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 79 selfloop transitions, 12 changer transitions 22/284 dead transitions. [2022-12-12 13:55:12,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 187 places, 284 transitions, 1223 flow [2022-12-12 13:55:12,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:55:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:55:12,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 995 transitions. [2022-12-12 13:55:12,278 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8592400690846287 [2022-12-12 13:55:12,279 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 14 predicate places. [2022-12-12 13:55:12,279 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 187 places, 284 transitions, 1223 flow [2022-12-12 13:55:12,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 187 places, 284 transitions, 1215 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 13:55:12,282 INFO L495 AbstractCegarLoop]: Abstraction has has 187 places, 284 transitions, 1215 flow [2022-12-12 13:55:12,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.8) internal successors, (779), 5 states have internal predecessors, (779), 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-12-12 13:55:12,282 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:12,282 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:12,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 13:55:12,283 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:12,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:12,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1739697974, now seen corresponding path program 3 times [2022-12-12 13:55:12,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:12,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535706366] [2022-12-12 13:55:12,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:12,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:12,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:12,349 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:12,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:12,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535706366] [2022-12-12 13:55:12,349 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535706366] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:12,349 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:12,349 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:55:12,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [133154686] [2022-12-12 13:55:12,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:12,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:55:12,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:12,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:55:12,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:55:12,351 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 193 [2022-12-12 13:55:12,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 187 places, 284 transitions, 1215 flow. Second operand has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-12-12 13:55:12,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:12,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 193 [2022-12-12 13:55:12,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:12,598 INFO L130 PetriNetUnfolder]: 397/1968 cut-off events. [2022-12-12 13:55:12,603 INFO L131 PetriNetUnfolder]: For 1846/2036 co-relation queries the response was YES. [2022-12-12 13:55:12,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4362 conditions, 1968 events. 397/1968 cut-off events. For 1846/2036 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 13369 event pairs, 135 based on Foata normal form. 5/1775 useless extension candidates. Maximal degree in co-relation 3170. Up to 360 conditions per place. [2022-12-12 13:55:12,611 INFO L137 encePairwiseOnDemand]: 187/193 looper letters, 89 selfloop transitions, 14 changer transitions 29/312 dead transitions. [2022-12-12 13:55:12,611 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 191 places, 312 transitions, 1667 flow [2022-12-12 13:55:12,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 13:55:12,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 13:55:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 813 transitions. [2022-12-12 13:55:12,613 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8424870466321244 [2022-12-12 13:55:12,615 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 18 predicate places. [2022-12-12 13:55:12,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 191 places, 312 transitions, 1667 flow [2022-12-12 13:55:12,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 190 places, 312 transitions, 1645 flow, removed 10 selfloop flow, removed 1 redundant places. [2022-12-12 13:55:12,618 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 312 transitions, 1645 flow [2022-12-12 13:55:12,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.75) internal successors, (635), 4 states have internal predecessors, (635), 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-12-12 13:55:12,619 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:12,619 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:12,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 13:55:12,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:12,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:12,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1801225394, now seen corresponding path program 4 times [2022-12-12 13:55:12,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:12,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571504916] [2022-12-12 13:55:12,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:12,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:12,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:12,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:12,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:12,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571504916] [2022-12-12 13:55:12,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571504916] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:12,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:12,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:55:12,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775603648] [2022-12-12 13:55:12,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:12,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:55:12,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:12,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:55:12,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:55:12,749 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2022-12-12 13:55:12,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 312 transitions, 1645 flow. Second operand has 6 states, 6 states have (on average 155.33333333333334) internal successors, (932), 6 states have internal predecessors, (932), 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-12-12 13:55:12,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:12,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2022-12-12 13:55:12,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:13,006 INFO L130 PetriNetUnfolder]: 391/1896 cut-off events. [2022-12-12 13:55:13,006 INFO L131 PetriNetUnfolder]: For 2563/2837 co-relation queries the response was YES. [2022-12-12 13:55:13,009 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4765 conditions, 1896 events. 391/1896 cut-off events. For 2563/2837 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 12644 event pairs, 149 based on Foata normal form. 11/1723 useless extension candidates. Maximal degree in co-relation 3520. Up to 428 conditions per place. [2022-12-12 13:55:13,014 INFO L137 encePairwiseOnDemand]: 185/193 looper letters, 94 selfloop transitions, 19 changer transitions 29/313 dead transitions. [2022-12-12 13:55:13,014 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 195 places, 313 transitions, 1870 flow [2022-12-12 13:55:13,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:55:13,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:55:13,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 976 transitions. [2022-12-12 13:55:13,016 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.842832469775475 [2022-12-12 13:55:13,017 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 22 predicate places. [2022-12-12 13:55:13,017 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 195 places, 313 transitions, 1870 flow [2022-12-12 13:55:13,021 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 195 places, 313 transitions, 1792 flow, removed 39 selfloop flow, removed 0 redundant places. [2022-12-12 13:55:13,021 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 313 transitions, 1792 flow [2022-12-12 13:55:13,021 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 155.33333333333334) internal successors, (932), 6 states have internal predecessors, (932), 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-12-12 13:55:13,022 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:13,022 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:13,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 13:55:13,022 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:13,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:13,022 INFO L85 PathProgramCache]: Analyzing trace with hash 345337088, now seen corresponding path program 1 times [2022-12-12 13:55:13,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:13,023 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108907192] [2022-12-12 13:55:13,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:13,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:13,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:13,189 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:13,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:13,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108907192] [2022-12-12 13:55:13,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108907192] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:13,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:13,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:55:13,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163246691] [2022-12-12 13:55:13,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:13,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:55:13,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:13,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:55:13,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:55:13,192 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 153 out of 193 [2022-12-12 13:55:13,193 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 195 places, 313 transitions, 1792 flow. Second operand has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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-12-12 13:55:13,193 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:13,193 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 153 of 193 [2022-12-12 13:55:13,194 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:13,514 INFO L130 PetriNetUnfolder]: 489/2453 cut-off events. [2022-12-12 13:55:13,515 INFO L131 PetriNetUnfolder]: For 3832/4504 co-relation queries the response was YES. [2022-12-12 13:55:13,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6593 conditions, 2453 events. 489/2453 cut-off events. For 3832/4504 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 18103 event pairs, 136 based on Foata normal form. 24/2254 useless extension candidates. Maximal degree in co-relation 3443. Up to 539 conditions per place. [2022-12-12 13:55:13,528 INFO L137 encePairwiseOnDemand]: 186/193 looper letters, 116 selfloop transitions, 19 changer transitions 29/335 dead transitions. [2022-12-12 13:55:13,529 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 335 transitions, 2288 flow [2022-12-12 13:55:13,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-12-12 13:55:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-12-12 13:55:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1139 transitions. [2022-12-12 13:55:13,532 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8430792005921539 [2022-12-12 13:55:13,533 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 28 predicate places. [2022-12-12 13:55:13,533 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 335 transitions, 2288 flow [2022-12-12 13:55:13,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 335 transitions, 1842 flow, removed 215 selfloop flow, removed 2 redundant places. [2022-12-12 13:55:13,544 INFO L495 AbstractCegarLoop]: Abstraction has has 199 places, 335 transitions, 1842 flow [2022-12-12 13:55:13,545 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 156.66666666666666) internal successors, (940), 6 states have internal predecessors, (940), 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-12-12 13:55:13,545 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:13,545 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:13,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 13:55:13,546 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:13,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash 272331952, now seen corresponding path program 2 times [2022-12-12 13:55:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:13,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772293910] [2022-12-12 13:55:13,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:13,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:13,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:13,685 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:13,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:13,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772293910] [2022-12-12 13:55:13,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772293910] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:55:13,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:55:13,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:55:13,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67436243] [2022-12-12 13:55:13,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:55:13,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:55:13,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:13,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:55:13,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:55:13,689 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 193 [2022-12-12 13:55:13,689 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 199 places, 335 transitions, 1842 flow. Second operand has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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-12-12 13:55:13,689 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:13,689 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 193 [2022-12-12 13:55:13,690 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:13,889 INFO L130 PetriNetUnfolder]: 457/2320 cut-off events. [2022-12-12 13:55:13,889 INFO L131 PetriNetUnfolder]: For 1996/2214 co-relation queries the response was YES. [2022-12-12 13:55:13,894 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5388 conditions, 2320 events. 457/2320 cut-off events. For 1996/2214 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 16020 event pairs, 131 based on Foata normal form. 12/2131 useless extension candidates. Maximal degree in co-relation 4550. Up to 356 conditions per place. [2022-12-12 13:55:13,901 INFO L137 encePairwiseOnDemand]: 188/193 looper letters, 57 selfloop transitions, 19 changer transitions 28/313 dead transitions. [2022-12-12 13:55:13,901 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 201 places, 313 transitions, 1838 flow [2022-12-12 13:55:13,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:55:13,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:55:13,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 684 transitions. [2022-12-12 13:55:13,903 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8860103626943006 [2022-12-12 13:55:13,904 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 28 predicate places. [2022-12-12 13:55:13,905 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 201 places, 313 transitions, 1838 flow [2022-12-12 13:55:13,911 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 313 transitions, 1778 flow, removed 30 selfloop flow, removed 0 redundant places. [2022-12-12 13:55:13,911 INFO L495 AbstractCegarLoop]: Abstraction has has 201 places, 313 transitions, 1778 flow [2022-12-12 13:55:13,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 166.75) internal successors, (667), 4 states have internal predecessors, (667), 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-12-12 13:55:13,912 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:13,912 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:13,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 13:55:13,912 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:13,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:13,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1284902338, now seen corresponding path program 1 times [2022-12-12 13:55:13,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:13,913 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381328580] [2022-12-12 13:55:13,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:13,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:13,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:55:14,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:55:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381328580] [2022-12-12 13:55:14,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381328580] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:55:14,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032540139] [2022-12-12 13:55:14,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:14,269 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:55:14,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:55:14,284 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-12-12 13:55:14,285 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-12-12 13:55:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:55:14,374 INFO L263 TraceCheckSpWp]: Trace formula consists of 318 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-12 13:55:14,384 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:55:15,158 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:55:15,162 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:55:15,162 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-12 13:55:15,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:55:15,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:55:15,727 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 13:55:15,728 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 13:55:16,320 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:55:16,320 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032540139] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:55:16,320 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:55:16,320 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2022-12-12 13:55:16,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397391786] [2022-12-12 13:55:16,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:55:16,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-12 13:55:16,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:16,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-12 13:55:16,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2022-12-12 13:55:16,326 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 193 [2022-12-12 13:55:16,329 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 201 places, 313 transitions, 1778 flow. Second operand has 41 states, 41 states have (on average 75.60975609756098) internal successors, (3100), 41 states have internal predecessors, (3100), 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-12-12 13:55:16,329 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:16,330 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 193 [2022-12-12 13:55:16,330 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:20,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 13:55:37,322 INFO L130 PetriNetUnfolder]: 13881/29090 cut-off events. [2022-12-12 13:55:37,323 INFO L131 PetriNetUnfolder]: For 36776/37410 co-relation queries the response was YES. [2022-12-12 13:55:37,367 INFO L83 FinitePrefix]: Finished finitePrefix Result has 83859 conditions, 29090 events. 13881/29090 cut-off events. For 36776/37410 co-relation queries the response was YES. Maximal size of possible extension queue 353. Compared 250115 event pairs, 827 based on Foata normal form. 100/27186 useless extension candidates. Maximal degree in co-relation 18967. Up to 4874 conditions per place. [2022-12-12 13:55:37,448 INFO L137 encePairwiseOnDemand]: 122/193 looper letters, 988 selfloop transitions, 355 changer transitions 795/2229 dead transitions. [2022-12-12 13:55:37,448 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 2229 transitions, 14347 flow [2022-12-12 13:55:37,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-12-12 13:55:37,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2022-12-12 13:55:37,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 14806 transitions. [2022-12-12 13:55:37,467 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.41024078024992383 [2022-12-12 13:55:37,468 INFO L295 CegarLoopForPetriNet]: 173 programPoint places, 214 predicate places. [2022-12-12 13:55:37,468 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 2229 transitions, 14347 flow [2022-12-12 13:55:37,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 2229 transitions, 11260 flow, removed 1405 selfloop flow, removed 19 redundant places. [2022-12-12 13:55:37,638 INFO L495 AbstractCegarLoop]: Abstraction has has 368 places, 2229 transitions, 11260 flow [2022-12-12 13:55:37,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 75.60975609756098) internal successors, (3100), 41 states have internal predecessors, (3100), 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-12-12 13:55:37,639 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:55:37,640 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:55:37,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 13:55:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-12-12 13:55:37,847 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:55:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:55:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash 2081058404, now seen corresponding path program 2 times [2022-12-12 13:55:37,848 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:55:37,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [933752415] [2022-12-12 13:55:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:55:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:55:37,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:56:40,496 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:56:40,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:56:40,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [933752415] [2022-12-12 13:56:40,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [933752415] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:56:40,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [642909089] [2022-12-12 13:56:40,496 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:56:40,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:56:40,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:56:40,501 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-12-12 13:56:40,502 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-12-12 13:56:40,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:56:40,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:56:40,685 INFO L263 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 53 conjunts are in the unsatisfiable core [2022-12-12 13:56:40,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:56:43,288 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 15 treesize of output 11 [2022-12-12 13:56:44,357 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 13:56:44,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 13:56:46,058 INFO L321 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-12-12 13:56:46,058 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 10 [2022-12-12 13:56:46,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:56:46,487 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:56:52,936 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (< ~x1~0 0) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) c_~f~0.base))) (= (select .cse0 (+ c_~f~0.offset (* ~x2~0 4))) (select .cse0 (+ (* ~x1~0 4) c_~f~0.offset)))) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 13:56:53,208 WARN L837 $PredicateComparison]: unable to prove that (forall ((~x1~0 Int) (~x2~0 Int) (v_ArrVal_157 (Array Int Int)) (v_ArrVal_158 (Array Int Int))) (or (< ~x1~0 0) (let ((.cse0 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_157) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_158) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (= (select .cse0 (+ (* ~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (select .cse0 (+ (* ~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (<= c_~size~0 ~x1~0) (< ~x2~0 0) (<= c_~size~0 ~x2~0))) is different from false [2022-12-12 13:56:53,872 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:56:53,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 55 treesize of output 44 [2022-12-12 13:56:53,881 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 13:56:53,881 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 85 [2022-12-12 13:56:53,889 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 13:56:53,889 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 54 [2022-12-12 13:56:53,896 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-12-12 13:56:53,896 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2022-12-12 13:56:54,363 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:56:54,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [642909089] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:56:54,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:56:54,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 29, 26] total 71 [2022-12-12 13:56:54,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448212647] [2022-12-12 13:56:54,363 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:56:54,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-12-12 13:56:54,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:56:54,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-12-12 13:56:54,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=324, Invalid=4313, Unknown=63, NotChecked=270, Total=4970 [2022-12-12 13:56:54,367 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 193 [2022-12-12 13:56:54,369 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 2229 transitions, 11260 flow. Second operand has 71 states, 71 states have (on average 46.985915492957744) internal successors, (3336), 71 states have internal predecessors, (3336), 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-12-12 13:56:54,369 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:56:54,369 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 193 [2022-12-12 13:56:54,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:57:00,911 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:18,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:57:20,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:57:33,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:57:45,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:57:54,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:58:13,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:58:18,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:58:21,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:58:40,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:58:46,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:03,949 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:13,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:17,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:20,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:27,665 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:33,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 13:59:42,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:46,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:48,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:51,962 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 13:59:58,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:01,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:03,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:05,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:09,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:14,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:21,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:27,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:28,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:32,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:34,498 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:48,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:00:54,076 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:58,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:00,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:15,647 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:19,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:22,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:48,536 WARN L233 SmtUtils]: Spent 13.22s on a formula simplification. DAG size of input: 115 DAG size of output: 84 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:01:50,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:01:53,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:00,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:02,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:04,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:07,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:23,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:25,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:27,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:31,118 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:41,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:43,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:45,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:47,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:51,278 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:56,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:02:59,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:12,390 WARN L233 SmtUtils]: Spent 5.77s on a formula simplification. DAG size of input: 134 DAG size of output: 100 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:03:13,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:15,735 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:42,761 WARN L233 SmtUtils]: Spent 19.04s on a formula simplification. DAG size of input: 160 DAG size of output: 124 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:03:44,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:47,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:49,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:52,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:03:55,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:12,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:14,355 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:33,865 WARN L233 SmtUtils]: Spent 8.23s on a formula simplification. DAG size of input: 166 DAG size of output: 130 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:04:35,806 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:38,290 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:40,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:42,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:43,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:45,893 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:47,961 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:50,022 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:52,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:54,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:56,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:04:58,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:00,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:02,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:05,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:26,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:28,503 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:30,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:32,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:55,282 WARN L233 SmtUtils]: Spent 13.36s on a formula simplification. DAG size of input: 140 DAG size of output: 106 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:05:56,848 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:05:58,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:01,689 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:03,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:05,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:16,601 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:18,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:21,008 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:23,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:26,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:27,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:29,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:32,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:34,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:36,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 14:06:38,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:40,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:57,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:06:59,392 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:01,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:03,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:05,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:07,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:09,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:11,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:13,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:15,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:17,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:19,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:21,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:24,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 14:07:26,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 14:07:46,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:48,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:50,721 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:52,934 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:54,951 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:07:57,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:08:12,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 14:08:14,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 14:08:31,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:08:32,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:08:34,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:09:13,918 WARN L233 SmtUtils]: Spent 19.49s on a formula simplification. DAG size of input: 141 DAG size of output: 123 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:09:15,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:09:18,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:09:20,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2022-12-12 14:09:22,354 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] Received shutdown request... [2022-12-12 14:09:42,311 WARN L249 SmtUtils]: Removed 4 from assertion stack [2022-12-12 14:09:42,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 242 states. [2022-12-12 14:09:42,313 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 14:09:42,320 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 14:09:42,346 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 14:09:42,346 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 14:09:42,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 14:09:42,513 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 133 for 3981ms.. [2022-12-12 14:09:42,514 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 14:09:42,515 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 14:09:42,515 INFO L445 BasicCegarLoop]: Path program histogram: [4, 2, 2, 1, 1] [2022-12-12 14:09:42,517 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:09:42,517 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:09:42,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:09:42 BasicIcfg [2022-12-12 14:09:42,519 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:09:42,519 INFO L158 Benchmark]: Toolchain (without parser) took 873929.00ms. Allocated memory was 206.6MB in the beginning and 763.4MB in the end (delta: 556.8MB). Free memory was 183.5MB in the beginning and 372.8MB in the end (delta: -189.4MB). Peak memory consumption was 652.9MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,519 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 183.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:09:42,520 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 206.6MB. Free memory was 182.9MB in the beginning and 171.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,520 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.12ms. Allocated memory is still 206.6MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,520 INFO L158 Benchmark]: Boogie Preprocessor took 32.96ms. Allocated memory is still 206.6MB. Free memory was 169.3MB in the beginning and 167.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,520 INFO L158 Benchmark]: RCFGBuilder took 561.70ms. Allocated memory is still 206.6MB. Free memory was 167.7MB in the beginning and 149.9MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,520 INFO L158 Benchmark]: TraceAbstraction took 873025.57ms. Allocated memory was 206.6MB in the beginning and 763.4MB in the end (delta: 556.8MB). Free memory was 148.9MB in the beginning and 372.8MB in the end (delta: -224.0MB). Peak memory consumption was 618.3MB. Max. memory is 8.0GB. [2022-12-12 14:09:42,521 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 206.6MB. Free memory is still 183.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 250.13ms. Allocated memory is still 206.6MB. Free memory was 182.9MB in the beginning and 171.4MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 50.12ms. Allocated memory is still 206.6MB. Free memory was 171.4MB in the beginning and 169.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.96ms. Allocated memory is still 206.6MB. Free memory was 169.3MB in the beginning and 167.7MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 561.70ms. Allocated memory is still 206.6MB. Free memory was 167.7MB in the beginning and 149.9MB in the end (delta: 17.8MB). Peak memory consumption was 17.8MB. Max. memory is 8.0GB. * TraceAbstraction took 873025.57ms. Allocated memory was 206.6MB in the beginning and 763.4MB in the end (delta: 556.8MB). Free memory was 148.9MB in the beginning and 372.8MB in the end (delta: -224.0MB). Peak memory consumption was 618.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 97]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 133 for 3981ms.. - TimeoutResultAtElement [Line: 92]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 133 for 3981ms.. - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateUnifier was unifying predicates,while SimplifyDDAWithTimeout was simplifying term of DAG size 133 for 3981ms.. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 261 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 872.9s, OverallIterations: 10, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 791.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 99 mSolverCounterUnknown, 10629 SdHoareTripleChecker+Valid, 362.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10629 mSDsluCounter, 15570 SdHoareTripleChecker+Invalid, 357.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 852 IncrementalHoareTripleChecker+Unchecked, 14767 mSDsCounter, 434 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26172 IncrementalHoareTripleChecker+Invalid, 27557 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 434 mSolverCounterUnsat, 803 mSDtfsCounter, 26172 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1373 GetRequests, 795 SyntacticMatches, 6 SemanticMatches, 571 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 45286 ImplicationChecksByTransitivity, 475.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=11260occurred in iteration=9, InterpolantAutomatonStates: 236, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 3814 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 79.8s InterpolantComputationTime, 1631 NumberOfCodeBlocks, 1631 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2045 ConstructedInterpolants, 191 QuantifiedInterpolants, 17500 SizeOfPredicates, 66 NumberOfNonLiveVariables, 886 ConjunctsInSsa, 98 ConjunctsInUnsatCore, 16 InterpolantComputations, 8 PerfectInterpolantSequences, 33/74 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown