/usr/bin/java -Xmx16000000000 -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-VariableLbe.epf --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-b8dbc81 [2023-01-28 10:31:07,613 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-01-28 10:31:07,615 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-01-28 10:31:07,642 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-01-28 10:31:07,642 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-01-28 10:31:07,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-01-28 10:31:07,644 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-01-28 10:31:07,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-01-28 10:31:07,646 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-01-28 10:31:07,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-01-28 10:31:07,647 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-01-28 10:31:07,648 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-01-28 10:31:07,648 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-01-28 10:31:07,649 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-01-28 10:31:07,650 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-01-28 10:31:07,650 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-01-28 10:31:07,651 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-01-28 10:31:07,652 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-01-28 10:31:07,653 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-01-28 10:31:07,654 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-01-28 10:31:07,655 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-01-28 10:31:07,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-01-28 10:31:07,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-01-28 10:31:07,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-01-28 10:31:07,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-01-28 10:31:07,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-01-28 10:31:07,660 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-01-28 10:31:07,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-01-28 10:31:07,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-01-28 10:31:07,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-01-28 10:31:07,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-01-28 10:31:07,662 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-01-28 10:31:07,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-01-28 10:31:07,663 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-01-28 10:31:07,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-01-28 10:31:07,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-01-28 10:31:07,664 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-01-28 10:31:07,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-01-28 10:31:07,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-01-28 10:31:07,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-01-28 10:31:07,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-01-28 10:31:07,671 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-VariableLbe.epf [2023-01-28 10:31:07,688 INFO L113 SettingsManager]: Loading preferences was successful [2023-01-28 10:31:07,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-01-28 10:31:07,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-01-28 10:31:07,689 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-01-28 10:31:07,689 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-01-28 10:31:07,689 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * Use SBE=true [2023-01-28 10:31:07,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * sizeof long=4 [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-01-28 10:31:07,690 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * sizeof long double=12 [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * Use constant arrays=true [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-01-28 10:31:07,691 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * To the following directory=./dump/ [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-01-28 10:31:07,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:31:07,692 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-01-28 10:31:07,692 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC 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: When to check the insufficient erros location relative to the other error locations -> AFTER [2023-01-28 10:31:07,875 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-01-28 10:31:07,891 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-01-28 10:31:07,893 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-01-28 10:31:07,894 INFO L271 PluginConnector]: Initializing CDTParser... [2023-01-28 10:31:07,895 INFO L275 PluginConnector]: CDTParser initialized [2023-01-28 10:31:07,896 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-01-28 10:31:08,817 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-01-28 10:31:08,979 INFO L351 CDTParser]: Found 1 translation units. [2023-01-28 10:31:08,979 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c [2023-01-28 10:31:08,985 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6178e42eb/c05551f90bbd4de38fd670032d2aaaae/FLAG0adf4b190 [2023-01-28 10:31:08,995 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6178e42eb/c05551f90bbd4de38fd670032d2aaaae [2023-01-28 10:31:08,997 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-01-28 10:31:08,998 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2023-01-28 10:31:09,000 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-01-28 10:31:09,000 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-01-28 10:31:09,002 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-01-28 10:31:09,003 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:31:08" (1/1) ... [2023-01-28 10:31:09,003 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7464c8a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09, skipping insertion in model container [2023-01-28 10:31:09,004 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.01 10:31:08" (1/1) ... [2023-01-28 10:31:09,008 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-01-28 10:31:09,022 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-01-28 10:31:09,116 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-01-28 10:31:09,121 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:31:09,126 INFO L203 MainTranslator]: Completed pre-run [2023-01-28 10:31:09,140 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-min-max-dec.wvr.c[3019,3032] [2023-01-28 10:31:09,142 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-01-28 10:31:09,148 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:31:09,148 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-01-28 10:31:09,152 INFO L208 MainTranslator]: Completed translation [2023-01-28 10:31:09,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09 WrapperNode [2023-01-28 10:31:09,153 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-01-28 10:31:09,153 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-01-28 10:31:09,153 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-01-28 10:31:09,153 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-01-28 10:31:09,157 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,163 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,178 INFO L138 Inliner]: procedures = 26, calls = 63, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2023-01-28 10:31:09,178 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-01-28 10:31:09,178 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-01-28 10:31:09,178 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-01-28 10:31:09,179 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-01-28 10:31:09,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,184 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,186 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,186 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,191 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,194 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-01-28 10:31:09,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-01-28 10:31:09,197 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-01-28 10:31:09,197 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-01-28 10:31:09,198 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (1/1) ... [2023-01-28 10:31:09,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-01-28 10:31:09,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:31:09,219 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) [2023-01-28 10:31:09,220 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 [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-01-28 10:31:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-01-28 10:31:09,246 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-01-28 10:31:09,246 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-01-28 10:31:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-01-28 10:31:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-01-28 10:31:09,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-01-28 10:31:09,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-01-28 10:31:09,248 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-01-28 10:31:09,332 INFO L236 CfgBuilder]: Building ICFG [2023-01-28 10:31:09,334 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-01-28 10:31:09,549 INFO L277 CfgBuilder]: Performing block encoding [2023-01-28 10:31:09,611 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-01-28 10:31:09,611 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-01-28 10:31:09,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:31:09 BoogieIcfgContainer [2023-01-28 10:31:09,617 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-01-28 10:31:09,618 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-01-28 10:31:09,618 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-01-28 10:31:09,620 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-01-28 10:31:09,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.01 10:31:08" (1/3) ... [2023-01-28 10:31:09,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf6296c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:31:09, skipping insertion in model container [2023-01-28 10:31:09,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.01 10:31:09" (2/3) ... [2023-01-28 10:31:09,621 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@cf6296c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.01 10:31:09, skipping insertion in model container [2023-01-28 10:31:09,621 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.01 10:31:09" (3/3) ... [2023-01-28 10:31:09,622 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-min-max-dec.wvr.c [2023-01-28 10:31:09,635 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-01-28 10:31:09,635 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-01-28 10:31:09,636 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-01-28 10:31:09,708 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-01-28 10:31:09,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 10:31:09,801 INFO L130 PetriNetUnfolder]: 12/158 cut-off events. [2023-01-28 10:31:09,801 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:31:09,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 175 conditions, 158 events. 12/158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 115 event pairs, 0 based on Foata normal form. 0/145 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 10:31:09,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 163 places, 162 transitions, 356 flow [2023-01-28 10:31:09,809 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 147 places, 146 transitions, 316 flow [2023-01-28 10:31:09,812 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-01-28 10:31:09,825 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 10:31:09,827 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 147 places, 146 transitions, 316 flow [2023-01-28 10:31:09,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 147 places, 146 transitions, 316 flow [2023-01-28 10:31:09,865 INFO L130 PetriNetUnfolder]: 12/146 cut-off events. [2023-01-28 10:31:09,865 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:31:09,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 146 events. 12/146 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 114 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 126. Up to 2 conditions per place. [2023-01-28 10:31:09,879 INFO L119 LiptonReduction]: Number of co-enabled transitions 2280 [2023-01-28 10:31:13,739 INFO L134 LiptonReduction]: Checked pairs total: 3482 [2023-01-28 10:31:13,740 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-01-28 10:31:13,759 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-01-28 10:31:13,764 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;@6a481abd, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-01-28 10:31:13,764 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-01-28 10:31:13,774 INFO L130 PetriNetUnfolder]: 4/30 cut-off events. [2023-01-28 10:31:13,775 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-01-28 10:31:13,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:13,776 INFO L208 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] [2023-01-28 10:31:13,776 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:13,779 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:13,780 INFO L85 PathProgramCache]: Analyzing trace with hash -957242749, now seen corresponding path program 1 times [2023-01-28 10:31:13,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:13,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023782564] [2023-01-28 10:31:13,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:13,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:14,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:31:14,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:14,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023782564] [2023-01-28 10:31:14,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023782564] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:31:14,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:31:14,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:31:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5459442] [2023-01-28 10:31:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:31:14,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:31:14,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:14,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:31:14,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:31:14,111 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 10:31:14,112 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 31 transitions, 86 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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) [2023-01-28 10:31:14,113 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:14,113 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 10:31:14,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:14,325 INFO L130 PetriNetUnfolder]: 1420/1898 cut-off events. [2023-01-28 10:31:14,325 INFO L131 PetriNetUnfolder]: For 113/113 co-relation queries the response was YES. [2023-01-28 10:31:14,330 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3999 conditions, 1898 events. 1420/1898 cut-off events. For 113/113 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 7098 event pairs, 765 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 3498. Up to 1552 conditions per place. [2023-01-28 10:31:14,337 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 42 selfloop transitions, 3 changer transitions 0/46 dead transitions. [2023-01-28 10:31:14,338 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 46 transitions, 215 flow [2023-01-28 10:31:14,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:31:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:31:14,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 10:31:14,352 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 10:31:14,352 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,353 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:14,357 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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) [2023-01-28 10:31:14,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,366 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,367 INFO L175 Difference]: Start difference. First operand has 40 places, 31 transitions, 86 flow. Second operand 4 states and 554 transitions. [2023-01-28 10:31:14,367 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 46 transitions, 215 flow [2023-01-28 10:31:14,372 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 46 transitions, 193 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-01-28 10:31:14,373 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 84 flow [2023-01-28 10:31:14,375 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=32, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=84, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2023-01-28 10:31:14,378 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -4 predicate places. [2023-01-28 10:31:14,378 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 84 flow [2023-01-28 10:31:14,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 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) [2023-01-28 10:31:14,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:14,379 INFO L208 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] [2023-01-28 10:31:14,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-01-28 10:31:14,379 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:14,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:14,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1622835390, now seen corresponding path program 1 times [2023-01-28 10:31:14,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:14,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747867452] [2023-01-28 10:31:14,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:14,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:14,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:14,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:14,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747867452] [2023-01-28 10:31:14,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747867452] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:31:14,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:31:14,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:31:14,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018396567] [2023-01-28 10:31:14,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:31:14,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:31:14,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:14,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:31:14,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:31:14,500 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 10:31:14,501 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 84 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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) [2023-01-28 10:31:14,501 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:14,501 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 10:31:14,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:14,667 INFO L130 PetriNetUnfolder]: 1718/2336 cut-off events. [2023-01-28 10:31:14,668 INFO L131 PetriNetUnfolder]: For 549/549 co-relation queries the response was YES. [2023-01-28 10:31:14,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5313 conditions, 2336 events. 1718/2336 cut-off events. For 549/549 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 8125 event pairs, 977 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 2424. Up to 1790 conditions per place. [2023-01-28 10:31:14,675 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 47 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 10:31:14,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 50 transitions, 233 flow [2023-01-28 10:31:14,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:31:14,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:31:14,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 557 transitions. [2023-01-28 10:31:14,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4704391891891892 [2023-01-28 10:31:14,677 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 557 transitions. [2023-01-28 10:31:14,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 557 transitions. [2023-01-28 10:31:14,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:14,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 557 transitions. [2023-01-28 10:31:14,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 139.25) internal successors, (557), 4 states have internal predecessors, (557), 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) [2023-01-28 10:31:14,680 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,680 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,680 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 84 flow. Second operand 4 states and 557 transitions. [2023-01-28 10:31:14,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 50 transitions, 233 flow [2023-01-28 10:31:14,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 50 transitions, 223 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 10:31:14,682 INFO L231 Difference]: Finished difference. Result has 38 places, 33 transitions, 92 flow [2023-01-28 10:31:14,682 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=92, PETRI_PLACES=38, PETRI_TRANSITIONS=33} [2023-01-28 10:31:14,682 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, -2 predicate places. [2023-01-28 10:31:14,682 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 33 transitions, 92 flow [2023-01-28 10:31:14,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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) [2023-01-28 10:31:14,683 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:14,683 INFO L208 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] [2023-01-28 10:31:14,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-01-28 10:31:14,683 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:14,683 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:14,683 INFO L85 PathProgramCache]: Analyzing trace with hash -1337805984, now seen corresponding path program 1 times [2023-01-28 10:31:14,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:14,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67722193] [2023-01-28 10:31:14,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:14,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:14,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:14,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:14,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:14,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67722193] [2023-01-28 10:31:14,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67722193] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:31:14,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:31:14,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-01-28 10:31:14,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622209093] [2023-01-28 10:31:14,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:31:14,756 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:31:14,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:14,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:31:14,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:31:14,758 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 296 [2023-01-28 10:31:14,759 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 33 transitions, 92 flow. Second operand has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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) [2023-01-28 10:31:14,759 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:14,759 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 296 [2023-01-28 10:31:14,760 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:14,908 INFO L130 PetriNetUnfolder]: 1632/2232 cut-off events. [2023-01-28 10:31:14,908 INFO L131 PetriNetUnfolder]: For 545/694 co-relation queries the response was YES. [2023-01-28 10:31:14,911 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5578 conditions, 2232 events. 1632/2232 cut-off events. For 545/694 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8389 event pairs, 977 based on Foata normal form. 149/1982 useless extension candidates. Maximal degree in co-relation 1672. Up to 1790 conditions per place. [2023-01-28 10:31:14,918 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 46 selfloop transitions, 3 changer transitions 0/50 dead transitions. [2023-01-28 10:31:14,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 50 transitions, 240 flow [2023-01-28 10:31:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-01-28 10:31:14,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-01-28 10:31:14,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 554 transitions. [2023-01-28 10:31:14,919 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46790540540540543 [2023-01-28 10:31:14,919 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:14,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 554 transitions. [2023-01-28 10:31:14,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 138.5) internal successors, (554), 4 states have internal predecessors, (554), 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) [2023-01-28 10:31:14,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,923 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 296.0) internal successors, (1480), 5 states have internal predecessors, (1480), 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) [2023-01-28 10:31:14,923 INFO L175 Difference]: Start difference. First operand has 38 places, 33 transitions, 92 flow. Second operand 4 states and 554 transitions. [2023-01-28 10:31:14,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 50 transitions, 240 flow [2023-01-28 10:31:14,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 50 transitions, 231 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-01-28 10:31:14,925 INFO L231 Difference]: Finished difference. Result has 40 places, 34 transitions, 100 flow [2023-01-28 10:31:14,926 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=100, PETRI_PLACES=40, PETRI_TRANSITIONS=34} [2023-01-28 10:31:14,926 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 0 predicate places. [2023-01-28 10:31:14,929 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 34 transitions, 100 flow [2023-01-28 10:31:14,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 134.0) internal successors, (536), 4 states have internal predecessors, (536), 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) [2023-01-28 10:31:14,930 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:14,930 INFO L208 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] [2023-01-28 10:31:14,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-01-28 10:31:14,930 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:14,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:14,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1347991008, now seen corresponding path program 1 times [2023-01-28 10:31:14,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:14,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038805106] [2023-01-28 10:31:14,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:14,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:14,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:15,047 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:31:15,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:15,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038805106] [2023-01-28 10:31:15,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038805106] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:31:15,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:31:15,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:31:15,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413480853] [2023-01-28 10:31:15,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:31:15,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-01-28 10:31:15,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:15,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-01-28 10:31:15,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-01-28 10:31:15,049 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 296 [2023-01-28 10:31:15,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 34 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-01-28 10:31:15,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:15,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 296 [2023-01-28 10:31:15,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:15,200 INFO L130 PetriNetUnfolder]: 1632/2233 cut-off events. [2023-01-28 10:31:15,200 INFO L131 PetriNetUnfolder]: For 878/1027 co-relation queries the response was YES. [2023-01-28 10:31:15,202 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5793 conditions, 2233 events. 1632/2233 cut-off events. For 878/1027 co-relation queries the response was YES. Maximal size of possible extension queue 97. Compared 8188 event pairs, 1243 based on Foata normal form. 149/1978 useless extension candidates. Maximal degree in co-relation 1883. Up to 2223 conditions per place. [2023-01-28 10:31:15,208 INFO L137 encePairwiseOnDemand]: 293/296 looper letters, 32 selfloop transitions, 2 changer transitions 0/35 dead transitions. [2023-01-28 10:31:15,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 35 transitions, 170 flow [2023-01-28 10:31:15,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-01-28 10:31:15,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-01-28 10:31:15,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 389 transitions. [2023-01-28 10:31:15,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380630630630631 [2023-01-28 10:31:15,213 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 389 transitions. [2023-01-28 10:31:15,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 389 transitions. [2023-01-28 10:31:15,213 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:15,213 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 389 transitions. [2023-01-28 10:31:15,214 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.66666666666666) internal successors, (389), 3 states have internal predecessors, (389), 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) [2023-01-28 10:31:15,215 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 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) [2023-01-28 10:31:15,215 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 296.0) internal successors, (1184), 4 states have internal predecessors, (1184), 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) [2023-01-28 10:31:15,215 INFO L175 Difference]: Start difference. First operand has 40 places, 34 transitions, 100 flow. Second operand 3 states and 389 transitions. [2023-01-28 10:31:15,215 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 35 transitions, 170 flow [2023-01-28 10:31:15,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 164 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-01-28 10:31:15,218 INFO L231 Difference]: Finished difference. Result has 41 places, 35 transitions, 106 flow [2023-01-28 10:31:15,219 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=106, PETRI_PLACES=41, PETRI_TRANSITIONS=35} [2023-01-28 10:31:15,220 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 1 predicate places. [2023-01-28 10:31:15,220 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 35 transitions, 106 flow [2023-01-28 10:31:15,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 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) [2023-01-28 10:31:15,220 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:15,221 INFO L208 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] [2023-01-28 10:31:15,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-01-28 10:31:15,221 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:15,221 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:15,221 INFO L85 PathProgramCache]: Analyzing trace with hash -406219004, now seen corresponding path program 1 times [2023-01-28 10:31:15,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:15,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472288328] [2023-01-28 10:31:15,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:15,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:15,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:15,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:15,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472288328] [2023-01-28 10:31:15,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472288328] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:31:15,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1416744689] [2023-01-28 10:31:15,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:15,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:31:15,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:31:15,719 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) [2023-01-28 10:31:15,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-01-28 10:31:15,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:15,836 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 35 conjunts are in the unsatisfiable core [2023-01-28 10:31:15,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:31:15,953 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 11 treesize of output 7 [2023-01-28 10:31:15,993 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 [2023-01-28 10:31:16,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:31:16,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:31:16,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:31:16,115 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:31:16,133 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:31:16,181 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-01-28 10:31:16,215 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:31:16,215 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:31:16,300 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-01-28 10:31:16,557 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) (<= (select (select .cse1 c_~A~0.base) c_~A~0.offset) c_~min~0)))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse2 (select (select .cse4 c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 .cse2) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse3 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse2 (+ 2 .cse3)) (< 2147483646 .cse3))))))))) is different from false [2023-01-28 10:31:16,584 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse1 (select (select .cse3 c_~A~0.base) c_~A~0.offset))) (or (< .cse0 .cse1) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse2 (select (select (store .cse3 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse1 (+ 2 .cse2)) (< 2147483646 .cse2)))))))) (forall ((v_ArrVal_184 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 c_~A~0.base) c_~A~0.offset) .cse0) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse5 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) c_~A~0.base) c_~A~0.offset))) (or (< .cse0 (+ 2 .cse5)) (< 2147483646 .cse5))))))))) is different from false [2023-01-28 10:31:16,636 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse2 (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse1 (select (select (store .cse2 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse0 (+ .cse1 2)) (< 2147483646 .cse1)))) (< (select (select .cse3 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse0)))))) (forall ((v_ArrVal_184 (Array Int Int)) (v_ArrVal_183 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_183))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse4 (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_184))) (or (<= (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|) .cse5) (forall ((v_ArrVal_185 (Array Int Int))) (let ((.cse6 (select (select (store .cse4 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_185) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< .cse5 (+ .cse6 2)) (< 2147483646 .cse6))))))))) is different from false [2023-01-28 10:31:16,655 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:31:16,656 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 125 treesize of output 77 [2023-01-28 10:31:16,662 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 2845 treesize of output 2653 [2023-01-28 10:31:16,691 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 110 treesize of output 104 [2023-01-28 10:31:16,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 120 [2023-01-28 10:31:16,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 150 treesize of output 138 [2023-01-28 10:31:16,798 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-01-28 10:31:16,798 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 122 treesize of output 1 [2023-01-28 10:31:16,808 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-01-28 10:31:16,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1416744689] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:31:16,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:31:16,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 28 [2023-01-28 10:31:16,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840476765] [2023-01-28 10:31:16,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:31:16,809 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 10:31:16,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:16,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 10:31:16,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=577, Unknown=9, NotChecked=156, Total=870 [2023-01-28 10:31:16,813 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-01-28 10:31:16,816 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 35 transitions, 106 flow. Second operand has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 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) [2023-01-28 10:31:16,816 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:16,816 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-01-28 10:31:16,816 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:19,590 INFO L130 PetriNetUnfolder]: 12624/17356 cut-off events. [2023-01-28 10:31:19,590 INFO L131 PetriNetUnfolder]: For 4404/5446 co-relation queries the response was YES. [2023-01-28 10:31:19,605 INFO L83 FinitePrefix]: Finished finitePrefix Result has 44463 conditions, 17356 events. 12624/17356 cut-off events. For 4404/5446 co-relation queries the response was YES. Maximal size of possible extension queue 723. Compared 93205 event pairs, 1024 based on Foata normal form. 1052/14660 useless extension candidates. Maximal degree in co-relation 44449. Up to 4507 conditions per place. [2023-01-28 10:31:19,638 INFO L137 encePairwiseOnDemand]: 286/296 looper letters, 240 selfloop transitions, 47 changer transitions 267/555 dead transitions. [2023-01-28 10:31:19,638 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 555 transitions, 2750 flow [2023-01-28 10:31:19,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2023-01-28 10:31:19,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2023-01-28 10:31:19,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 3633 transitions. [2023-01-28 10:31:19,645 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37192874692874694 [2023-01-28 10:31:19,645 INFO L72 ComplementDD]: Start complementDD. Operand 33 states and 3633 transitions. [2023-01-28 10:31:19,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33 states and 3633 transitions. [2023-01-28 10:31:19,646 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:19,646 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 33 states and 3633 transitions. [2023-01-28 10:31:19,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 34 states, 33 states have (on average 110.0909090909091) internal successors, (3633), 33 states have internal predecessors, (3633), 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) [2023-01-28 10:31:19,658 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 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) [2023-01-28 10:31:19,659 INFO L81 ComplementDD]: Finished complementDD. Result has 34 states, 34 states have (on average 296.0) internal successors, (10064), 34 states have internal predecessors, (10064), 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) [2023-01-28 10:31:19,660 INFO L175 Difference]: Start difference. First operand has 41 places, 35 transitions, 106 flow. Second operand 33 states and 3633 transitions. [2023-01-28 10:31:19,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 555 transitions, 2750 flow [2023-01-28 10:31:19,708 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 555 transitions, 2746 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-01-28 10:31:19,711 INFO L231 Difference]: Finished difference. Result has 99 places, 86 transitions, 498 flow [2023-01-28 10:31:19,711 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=33, PETRI_FLOW=498, PETRI_PLACES=99, PETRI_TRANSITIONS=86} [2023-01-28 10:31:19,712 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 59 predicate places. [2023-01-28 10:31:19,712 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 86 transitions, 498 flow [2023-01-28 10:31:19,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 98.0) internal successors, (2940), 30 states have internal predecessors, (2940), 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) [2023-01-28 10:31:19,713 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:19,713 INFO L208 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] [2023-01-28 10:31:19,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-01-28 10:31:19,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:31:19,920 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:19,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:19,920 INFO L85 PathProgramCache]: Analyzing trace with hash -776649670, now seen corresponding path program 2 times [2023-01-28 10:31:19,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:19,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066679818] [2023-01-28 10:31:19,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:19,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:20,167 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:31:20,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:20,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066679818] [2023-01-28 10:31:20,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066679818] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:31:20,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:31:20,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:31:20,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187788445] [2023-01-28 10:31:20,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:31:20,170 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:31:20,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:20,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:31:20,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:31:20,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 10:31:20,173 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 86 transitions, 498 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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) [2023-01-28 10:31:20,173 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:20,173 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 10:31:20,173 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:21,224 INFO L130 PetriNetUnfolder]: 9630/13442 cut-off events. [2023-01-28 10:31:21,224 INFO L131 PetriNetUnfolder]: For 68859/70453 co-relation queries the response was YES. [2023-01-28 10:31:21,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52345 conditions, 13442 events. 9630/13442 cut-off events. For 68859/70453 co-relation queries the response was YES. Maximal size of possible extension queue 568. Compared 72782 event pairs, 864 based on Foata normal form. 1595/14187 useless extension candidates. Maximal degree in co-relation 52298. Up to 7235 conditions per place. [2023-01-28 10:31:21,276 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 93 selfloop transitions, 2 changer transitions 160/256 dead transitions. [2023-01-28 10:31:21,276 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 256 transitions, 2064 flow [2023-01-28 10:31:21,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:31:21,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:31:21,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 747 transitions. [2023-01-28 10:31:21,281 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5047297297297297 [2023-01-28 10:31:21,281 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 747 transitions. [2023-01-28 10:31:21,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 747 transitions. [2023-01-28 10:31:21,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:21,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 747 transitions. [2023-01-28 10:31:21,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 149.4) internal successors, (747), 5 states have internal predecessors, (747), 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) [2023-01-28 10:31:21,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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) [2023-01-28 10:31:21,285 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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) [2023-01-28 10:31:21,285 INFO L175 Difference]: Start difference. First operand has 99 places, 86 transitions, 498 flow. Second operand 5 states and 747 transitions. [2023-01-28 10:31:21,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 256 transitions, 2064 flow [2023-01-28 10:31:21,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 256 transitions, 1985 flow, removed 38 selfloop flow, removed 17 redundant places. [2023-01-28 10:31:21,439 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 301 flow [2023-01-28 10:31:21,439 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=461, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=301, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-01-28 10:31:21,440 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 33 predicate places. [2023-01-28 10:31:21,440 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 301 flow [2023-01-28 10:31:21,440 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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) [2023-01-28 10:31:21,440 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:21,440 INFO L208 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] [2023-01-28 10:31:21,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-01-28 10:31:21,441 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:21,441 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -421841092, now seen corresponding path program 3 times [2023-01-28 10:31:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969212302] [2023-01-28 10:31:21,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:31:21,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:21,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969212302] [2023-01-28 10:31:21,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969212302] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:31:21,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246362193] [2023-01-28 10:31:21,940 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:31:21,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:31:21,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:31:21,941 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) [2023-01-28 10:31:21,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-01-28 10:31:22,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-01-28 10:31:22,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:31:22,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 10:31:22,097 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:31:22,174 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 11 treesize of output 7 [2023-01-28 10:31:22,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:31:22,228 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:31:22,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:31:22,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:22,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:31:28,758 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_284 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_284) c_~A~0.base) c_~A~0.offset))) (or (<= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) (+ .cse0 1)) (<= 2147483647 .cse0)))) is different from false [2023-01-28 10:31:28,765 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:31:28,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 45 [2023-01-28 10:31:28,767 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 72 [2023-01-28 10:31:28,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-01-28 10:31:28,774 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2023-01-28 10:31:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:28,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246362193] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:31:28,788 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:31:28,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 11] total 26 [2023-01-28 10:31:28,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755240027] [2023-01-28 10:31:28,788 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:31:28,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-01-28 10:31:28,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:28,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-01-28 10:31:28,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=560, Unknown=11, NotChecked=50, Total=756 [2023-01-28 10:31:28,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 296 [2023-01-28 10:31:28,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 301 flow. Second operand has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 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) [2023-01-28 10:31:28,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:28,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 296 [2023-01-28 10:31:28,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:35,044 INFO L130 PetriNetUnfolder]: 24993/34453 cut-off events. [2023-01-28 10:31:35,044 INFO L131 PetriNetUnfolder]: For 191930/191930 co-relation queries the response was YES. [2023-01-28 10:31:35,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136650 conditions, 34453 events. 24993/34453 cut-off events. For 191930/191930 co-relation queries the response was YES. Maximal size of possible extension queue 1239. Compared 199011 event pairs, 1322 based on Foata normal form. 20/31888 useless extension candidates. Maximal degree in co-relation 136616. Up to 7291 conditions per place. [2023-01-28 10:31:35,190 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 388 selfloop transitions, 177 changer transitions 760/1325 dead transitions. [2023-01-28 10:31:35,190 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 1325 transitions, 9162 flow [2023-01-28 10:31:35,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2023-01-28 10:31:35,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2023-01-28 10:31:35,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 9798 transitions. [2023-01-28 10:31:35,207 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.380475302889096 [2023-01-28 10:31:35,207 INFO L72 ComplementDD]: Start complementDD. Operand 87 states and 9798 transitions. [2023-01-28 10:31:35,207 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 9798 transitions. [2023-01-28 10:31:35,210 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:31:35,210 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 87 states and 9798 transitions. [2023-01-28 10:31:35,222 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 88 states, 87 states have (on average 112.62068965517241) internal successors, (9798), 87 states have internal predecessors, (9798), 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) [2023-01-28 10:31:35,243 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 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) [2023-01-28 10:31:35,256 INFO L81 ComplementDD]: Finished complementDD. Result has 88 states, 88 states have (on average 296.0) internal successors, (26048), 88 states have internal predecessors, (26048), 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) [2023-01-28 10:31:35,256 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 301 flow. Second operand 87 states and 9798 transitions. [2023-01-28 10:31:35,256 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 1325 transitions, 9162 flow [2023-01-28 10:31:36,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 1325 transitions, 8285 flow, removed 408 selfloop flow, removed 10 redundant places. [2023-01-28 10:31:36,951 INFO L231 Difference]: Finished difference. Result has 211 places, 233 transitions, 2150 flow [2023-01-28 10:31:36,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=274, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=87, PETRI_FLOW=2150, PETRI_PLACES=211, PETRI_TRANSITIONS=233} [2023-01-28 10:31:36,951 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 171 predicate places. [2023-01-28 10:31:36,952 INFO L495 AbstractCegarLoop]: Abstraction has has 211 places, 233 transitions, 2150 flow [2023-01-28 10:31:36,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 103.0) internal successors, (2884), 28 states have internal predecessors, (2884), 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) [2023-01-28 10:31:36,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:31:36,953 INFO L208 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] [2023-01-28 10:31:36,958 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-01-28 10:31:37,158 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,SelfDestructingSolverStorable6 [2023-01-28 10:31:37,158 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:31:37,158 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:31:37,159 INFO L85 PathProgramCache]: Analyzing trace with hash -551404586, now seen corresponding path program 4 times [2023-01-28 10:31:37,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:31:37,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738662442] [2023-01-28 10:31:37,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:31:37,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:31:37,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:31:37,829 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-01-28 10:31:37,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:31:37,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738662442] [2023-01-28 10:31:37,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738662442] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:31:37,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107503121] [2023-01-28 10:31:37,829 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 10:31:37,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:31:37,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:31:37,830 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) [2023-01-28 10:31:37,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-01-28 10:31:37,917 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 10:31:37,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:31:37,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 39 conjunts are in the unsatisfiable core [2023-01-28 10:31:37,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:31:37,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 894 treesize of output 862 [2023-01-28 10:31:37,987 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:31:38,005 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:31:38,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-01-28 10:31:38,052 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 10:31:38,071 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:38,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:31:42,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 247 treesize of output 215 [2023-01-28 10:31:42,497 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 37 [2023-01-28 10:31:42,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 45 [2023-01-28 10:31:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:31:42,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107503121] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:31:42,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:31:42,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 30 [2023-01-28 10:31:42,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028588939] [2023-01-28 10:31:42,563 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:31:42,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-01-28 10:31:42,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:31:42,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-01-28 10:31:42,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=786, Unknown=34, NotChecked=0, Total=992 [2023-01-28 10:31:42,565 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 296 [2023-01-28 10:31:42,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 211 places, 233 transitions, 2150 flow. Second operand has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 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) [2023-01-28 10:31:42,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:31:42,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 296 [2023-01-28 10:31:42,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:31:50,991 WARN L222 SmtUtils]: Spent 6.16s on a formula simplification. DAG size of input: 59 DAG size of output: 33 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:32:19,935 WARN L222 SmtUtils]: Spent 6.10s on a formula simplification. DAG size of input: 74 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:33:15,250 WARN L222 SmtUtils]: Spent 6.11s on a formula simplification. DAG size of input: 68 DAG size of output: 43 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:33:54,860 INFO L130 PetriNetUnfolder]: 46739/65136 cut-off events. [2023-01-28 10:33:54,860 INFO L131 PetriNetUnfolder]: For 4923944/4923944 co-relation queries the response was YES. [2023-01-28 10:33:55,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 624230 conditions, 65136 events. 46739/65136 cut-off events. For 4923944/4923944 co-relation queries the response was YES. Maximal size of possible extension queue 2395. Compared 418459 event pairs, 1872 based on Foata normal form. 35/65170 useless extension candidates. Maximal degree in co-relation 624132. Up to 17165 conditions per place. [2023-01-28 10:33:55,844 INFO L137 encePairwiseOnDemand]: 283/296 looper letters, 532 selfloop transitions, 475 changer transitions 1128/2135 dead transitions. [2023-01-28 10:33:55,844 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 284 places, 2135 transitions, 32125 flow [2023-01-28 10:33:55,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2023-01-28 10:33:55,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2023-01-28 10:33:55,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 13204 transitions. [2023-01-28 10:33:55,859 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3512449457331347 [2023-01-28 10:33:55,859 INFO L72 ComplementDD]: Start complementDD. Operand 127 states and 13204 transitions. [2023-01-28 10:33:55,859 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 13204 transitions. [2023-01-28 10:33:55,863 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:33:55,863 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 127 states and 13204 transitions. [2023-01-28 10:33:55,879 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 128 states, 127 states have (on average 103.96850393700787) internal successors, (13204), 127 states have internal predecessors, (13204), 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) [2023-01-28 10:33:55,912 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 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) [2023-01-28 10:33:55,921 INFO L81 ComplementDD]: Finished complementDD. Result has 128 states, 128 states have (on average 296.0) internal successors, (37888), 128 states have internal predecessors, (37888), 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) [2023-01-28 10:33:55,922 INFO L175 Difference]: Start difference. First operand has 211 places, 233 transitions, 2150 flow. Second operand 127 states and 13204 transitions. [2023-01-28 10:33:55,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 284 places, 2135 transitions, 32125 flow [2023-01-28 10:34:37,093 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 241 places, 2135 transitions, 21452 flow, removed 5210 selfloop flow, removed 43 redundant places. [2023-01-28 10:34:37,106 INFO L231 Difference]: Finished difference. Result has 351 places, 549 transitions, 7180 flow [2023-01-28 10:34:37,106 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=1933, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=233, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=186, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=127, PETRI_FLOW=7180, PETRI_PLACES=351, PETRI_TRANSITIONS=549} [2023-01-28 10:34:37,107 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 311 predicate places. [2023-01-28 10:34:37,107 INFO L495 AbstractCegarLoop]: Abstraction has has 351 places, 549 transitions, 7180 flow [2023-01-28 10:34:37,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 94.5) internal successors, (3024), 32 states have internal predecessors, (3024), 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) [2023-01-28 10:34:37,108 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:34:37,108 INFO L208 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] [2023-01-28 10:34:37,120 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-01-28 10:34:37,308 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:34:37,309 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:34:37,309 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:34:37,309 INFO L85 PathProgramCache]: Analyzing trace with hash -870441776, now seen corresponding path program 5 times [2023-01-28 10:34:37,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:34:37,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630482395] [2023-01-28 10:34:37,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:34:37,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:34:37,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:34:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:34:37,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:34:37,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630482395] [2023-01-28 10:34:37,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630482395] provided 1 perfect and 0 imperfect interpolant sequences [2023-01-28 10:34:37,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-01-28 10:34:37,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-01-28 10:34:37,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759360199] [2023-01-28 10:34:37,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:34:37,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-01-28 10:34:37,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:34:37,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-01-28 10:34:37,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-01-28 10:34:37,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 296 [2023-01-28 10:34:37,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 351 places, 549 transitions, 7180 flow. Second operand has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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) [2023-01-28 10:34:37,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:34:37,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 296 [2023-01-28 10:34:37,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:34:49,786 INFO L130 PetriNetUnfolder]: 36956/52628 cut-off events. [2023-01-28 10:34:49,786 INFO L131 PetriNetUnfolder]: For 8242088/8244824 co-relation queries the response was YES. [2023-01-28 10:34:50,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 621363 conditions, 52628 events. 36956/52628 cut-off events. For 8242088/8244824 co-relation queries the response was YES. Maximal size of possible extension queue 2087. Compared 344625 event pairs, 10277 based on Foata normal form. 2150/54610 useless extension candidates. Maximal degree in co-relation 621194. Up to 40021 conditions per place. [2023-01-28 10:34:51,053 INFO L137 encePairwiseOnDemand]: 292/296 looper letters, 504 selfloop transitions, 38 changer transitions 410/990 dead transitions. [2023-01-28 10:34:51,053 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 275 places, 990 transitions, 15337 flow [2023-01-28 10:34:51,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-01-28 10:34:51,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-01-28 10:34:51,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 741 transitions. [2023-01-28 10:34:51,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5006756756756757 [2023-01-28 10:34:51,054 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 741 transitions. [2023-01-28 10:34:51,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 741 transitions. [2023-01-28 10:34:51,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:34:51,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 741 transitions. [2023-01-28 10:34:51,055 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 148.2) internal successors, (741), 5 states have internal predecessors, (741), 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) [2023-01-28 10:34:51,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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) [2023-01-28 10:34:51,056 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 296.0) internal successors, (1776), 6 states have internal predecessors, (1776), 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) [2023-01-28 10:34:51,056 INFO L175 Difference]: Start difference. First operand has 351 places, 549 transitions, 7180 flow. Second operand 5 states and 741 transitions. [2023-01-28 10:34:51,057 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 275 places, 990 transitions, 15337 flow [2023-01-28 10:35:46,618 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 198 places, 990 transitions, 14132 flow, removed 568 selfloop flow, removed 77 redundant places. [2023-01-28 10:35:46,626 INFO L231 Difference]: Finished difference. Result has 200 places, 521 transitions, 6411 flow [2023-01-28 10:35:46,627 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6647, PETRI_DIFFERENCE_MINUEND_PLACES=194, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=549, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=511, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=6411, PETRI_PLACES=200, PETRI_TRANSITIONS=521} [2023-01-28 10:35:46,627 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 160 predicate places. [2023-01-28 10:35:46,627 INFO L495 AbstractCegarLoop]: Abstraction has has 200 places, 521 transitions, 6411 flow [2023-01-28 10:35:46,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.5) internal successors, (570), 4 states have internal predecessors, (570), 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) [2023-01-28 10:35:46,627 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:35:46,627 INFO L208 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] [2023-01-28 10:35:46,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-01-28 10:35:46,628 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:35:46,628 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:35:46,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1301239454, now seen corresponding path program 6 times [2023-01-28 10:35:46,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:35:46,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145085482] [2023-01-28 10:35:46,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:35:46,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:35:46,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:35:46,997 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:35:46,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:35:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145085482] [2023-01-28 10:35:46,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145085482] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:35:46,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1145366046] [2023-01-28 10:35:46,998 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 10:35:46,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:35:46,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:35:47,000 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:35:47,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-01-28 10:35:47,110 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 10:35:47,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:35:47,112 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 43 conjunts are in the unsatisfiable core [2023-01-28 10:35:47,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:35:47,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:35:47,240 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:35:47,277 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:35:47,278 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:35:47,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:35:47,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:35:47,391 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-01-28 10:35:47,421 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-01-28 10:35:47,449 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:35:47,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:35:47,784 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_455 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset))) (or (< 2147483646 .cse0) (< c_~min~0 (+ 2 .cse0))))) is different from false [2023-01-28 10:35:47,797 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_454 (Array Int Int)) (v_ArrVal_455 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_454) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_455) c_~A~0.base) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0)))) is different from false [2023-01-28 10:35:48,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 535 treesize of output 471 [2023-01-28 10:35:48,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 221 treesize of output 205 [2023-01-28 10:35:48,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 93 [2023-01-28 10:35:48,941 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 101 [2023-01-28 10:35:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-01-28 10:35:49,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1145366046] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:35:49,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:35:49,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 13, 13] total 31 [2023-01-28 10:35:49,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263942137] [2023-01-28 10:35:49,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:35:49,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-01-28 10:35:49,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:35:49,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-01-28 10:35:49,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=768, Unknown=11, NotChecked=118, Total=1056 [2023-01-28 10:35:49,048 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 296 [2023-01-28 10:35:49,050 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 200 places, 521 transitions, 6411 flow. Second operand has 33 states, 33 states have (on average 96.63636363636364) internal successors, (3189), 33 states have internal predecessors, (3189), 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) [2023-01-28 10:35:49,050 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:35:49,050 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 296 [2023-01-28 10:35:49,050 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:36:03,614 INFO L130 PetriNetUnfolder]: 45846/64594 cut-off events. [2023-01-28 10:36:03,614 INFO L131 PetriNetUnfolder]: For 2749599/2749599 co-relation queries the response was YES. [2023-01-28 10:36:04,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 488267 conditions, 64594 events. 45846/64594 cut-off events. For 2749599/2749599 co-relation queries the response was YES. Maximal size of possible extension queue 2384. Compared 423067 event pairs, 4967 based on Foata normal form. 29/64622 useless extension candidates. Maximal degree in co-relation 488171. Up to 17095 conditions per place. [2023-01-28 10:36:04,319 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 339 selfloop transitions, 415 changer transitions 576/1330 dead transitions. [2023-01-28 10:36:04,319 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 1330 transitions, 19334 flow [2023-01-28 10:36:04,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2023-01-28 10:36:04,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2023-01-28 10:36:04,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 4992 transitions. [2023-01-28 10:36:04,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3588269120184014 [2023-01-28 10:36:04,324 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 4992 transitions. [2023-01-28 10:36:04,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 4992 transitions. [2023-01-28 10:36:04,325 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:36:04,325 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 4992 transitions. [2023-01-28 10:36:04,330 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 106.2127659574468) internal successors, (4992), 47 states have internal predecessors, (4992), 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) [2023-01-28 10:36:04,336 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 296.0) internal successors, (14208), 48 states have internal predecessors, (14208), 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) [2023-01-28 10:36:04,337 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 296.0) internal successors, (14208), 48 states have internal predecessors, (14208), 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) [2023-01-28 10:36:04,337 INFO L175 Difference]: Start difference. First operand has 200 places, 521 transitions, 6411 flow. Second operand 47 states and 4992 transitions. [2023-01-28 10:36:04,337 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 1330 transitions, 19334 flow [2023-01-28 10:36:25,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 238 places, 1330 transitions, 18406 flow, removed 437 selfloop flow, removed 5 redundant places. [2023-01-28 10:36:25,318 INFO L231 Difference]: Finished difference. Result has 272 places, 559 transitions, 8374 flow [2023-01-28 10:36:25,318 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=6318, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=521, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=364, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=147, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=8374, PETRI_PLACES=272, PETRI_TRANSITIONS=559} [2023-01-28 10:36:25,318 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 232 predicate places. [2023-01-28 10:36:25,318 INFO L495 AbstractCegarLoop]: Abstraction has has 272 places, 559 transitions, 8374 flow [2023-01-28 10:36:25,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 96.63636363636364) internal successors, (3189), 33 states have internal predecessors, (3189), 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) [2023-01-28 10:36:25,319 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:36:25,319 INFO L208 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] [2023-01-28 10:36:25,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-01-28 10:36:25,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:36:25,523 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:36:25,524 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:36:25,524 INFO L85 PathProgramCache]: Analyzing trace with hash -2047246626, now seen corresponding path program 7 times [2023-01-28 10:36:25,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:36:25,524 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984981937] [2023-01-28 10:36:25,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:36:25,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:36:25,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:36:25,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:36:25,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:36:25,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984981937] [2023-01-28 10:36:25,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984981937] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:36:25,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [94990424] [2023-01-28 10:36:25,715 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 10:36:25,715 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:36:25,715 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:36:25,716 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:36:25,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-01-28 10:36:25,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:36:25,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 17 conjunts are in the unsatisfiable core [2023-01-28 10:36:25,814 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:36:25,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:36:25,875 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:36:25,875 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:36:26,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-01-28 10:36:26,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [94990424] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:36:26,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:36:26,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 14 [2023-01-28 10:36:26,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912331876] [2023-01-28 10:36:26,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:36:26,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-01-28 10:36:26,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:36:26,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-01-28 10:36:26,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2023-01-28 10:36:26,007 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 115 out of 296 [2023-01-28 10:36:26,007 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 272 places, 559 transitions, 8374 flow. Second operand has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 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) [2023-01-28 10:36:26,007 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:36:26,007 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 115 of 296 [2023-01-28 10:36:26,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:36:41,777 INFO L130 PetriNetUnfolder]: 56429/79895 cut-off events. [2023-01-28 10:36:41,778 INFO L131 PetriNetUnfolder]: For 6520949/6523562 co-relation queries the response was YES. [2023-01-28 10:36:43,006 INFO L83 FinitePrefix]: Finished finitePrefix Result has 731356 conditions, 79895 events. 56429/79895 cut-off events. For 6520949/6523562 co-relation queries the response was YES. Maximal size of possible extension queue 3107. Compared 549107 event pairs, 13346 based on Foata normal form. 2257/82074 useless extension candidates. Maximal degree in co-relation 731229. Up to 41283 conditions per place. [2023-01-28 10:36:43,280 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 776 selfloop transitions, 229 changer transitions 128/1167 dead transitions. [2023-01-28 10:36:43,281 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 249 places, 1167 transitions, 19796 flow [2023-01-28 10:36:43,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 10:36:43,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 10:36:43,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1063 transitions. [2023-01-28 10:36:43,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44890202702702703 [2023-01-28 10:36:43,282 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1063 transitions. [2023-01-28 10:36:43,282 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1063 transitions. [2023-01-28 10:36:43,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:36:43,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1063 transitions. [2023-01-28 10:36:43,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 132.875) internal successors, (1063), 8 states have internal predecessors, (1063), 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) [2023-01-28 10:36:43,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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) [2023-01-28 10:36:43,285 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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) [2023-01-28 10:36:43,285 INFO L175 Difference]: Start difference. First operand has 272 places, 559 transitions, 8374 flow. Second operand 8 states and 1063 transitions. [2023-01-28 10:36:43,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 249 places, 1167 transitions, 19796 flow [2023-01-28 10:37:29,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 211 places, 1167 transitions, 18331 flow, removed 250 selfloop flow, removed 38 redundant places. [2023-01-28 10:37:29,362 INFO L231 Difference]: Finished difference. Result has 217 places, 730 transitions, 10845 flow [2023-01-28 10:37:29,362 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=7781, PETRI_DIFFERENCE_MINUEND_PLACES=204, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=559, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=391, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=10845, PETRI_PLACES=217, PETRI_TRANSITIONS=730} [2023-01-28 10:37:29,363 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 177 predicate places. [2023-01-28 10:37:29,363 INFO L495 AbstractCegarLoop]: Abstraction has has 217 places, 730 transitions, 10845 flow [2023-01-28 10:37:29,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 120.0) internal successors, (720), 6 states have internal predecessors, (720), 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) [2023-01-28 10:37:29,363 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:37:29,363 INFO L208 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] [2023-01-28 10:37:29,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-01-28 10:37:29,563 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-01-28 10:37:29,564 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:37:29,564 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:37:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash 186363290, now seen corresponding path program 8 times [2023-01-28 10:37:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:37:29,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19560180] [2023-01-28 10:37:29,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:37:29,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:37:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:37:29,852 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:37:29,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:37:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19560180] [2023-01-28 10:37:29,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19560180] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:37:29,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348312914] [2023-01-28 10:37:29,853 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:37:29,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:37:29,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:37:29,854 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:37:29,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-01-28 10:37:30,136 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:37:30,136 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:37:30,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 10:37:30,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:37:30,232 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:37:30,233 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:37:30,274 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:37:30,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:37:30,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:37:30,585 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-01-28 10:37:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:37:30,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348312914] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:37:30,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:37:30,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8, 9] total 26 [2023-01-28 10:37:30,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1311447152] [2023-01-28 10:37:30,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:37:30,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 10:37:30,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:37:30,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 10:37:30,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=608, Unknown=7, NotChecked=0, Total=756 [2023-01-28 10:37:30,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 296 [2023-01-28 10:37:30,614 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 217 places, 730 transitions, 10845 flow. Second operand has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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) [2023-01-28 10:37:30,614 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:37:30,614 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 296 [2023-01-28 10:37:30,614 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:38:00,374 INFO L130 PetriNetUnfolder]: 104393/147380 cut-off events. [2023-01-28 10:38:00,374 INFO L131 PetriNetUnfolder]: For 7619532/7624240 co-relation queries the response was YES. [2023-01-28 10:38:02,213 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187946 conditions, 147380 events. 104393/147380 cut-off events. For 7619532/7624240 co-relation queries the response was YES. Maximal size of possible extension queue 5794. Compared 1082859 event pairs, 23018 based on Foata normal form. 4292/151535 useless extension candidates. Maximal degree in co-relation 1187841. Up to 43163 conditions per place. [2023-01-28 10:38:02,544 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 569 selfloop transitions, 197 changer transitions 1301/2087 dead transitions. [2023-01-28 10:38:02,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 226 places, 2087 transitions, 35967 flow [2023-01-28 10:38:02,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 10:38:02,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 10:38:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1435 transitions. [2023-01-28 10:38:02,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40399774774774777 [2023-01-28 10:38:02,546 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1435 transitions. [2023-01-28 10:38:02,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1435 transitions. [2023-01-28 10:38:02,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:38:02,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1435 transitions. [2023-01-28 10:38:02,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.58333333333333) internal successors, (1435), 12 states have internal predecessors, (1435), 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) [2023-01-28 10:38:02,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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) [2023-01-28 10:38:02,550 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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) [2023-01-28 10:38:02,550 INFO L175 Difference]: Start difference. First operand has 217 places, 730 transitions, 10845 flow. Second operand 12 states and 1435 transitions. [2023-01-28 10:38:02,550 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 226 places, 2087 transitions, 35967 flow [2023-01-28 10:39:28,800 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 224 places, 2087 transitions, 35955 flow, removed 6 selfloop flow, removed 2 redundant places. [2023-01-28 10:39:28,815 INFO L231 Difference]: Finished difference. Result has 234 places, 580 transitions, 9784 flow [2023-01-28 10:39:28,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=10841, PETRI_DIFFERENCE_MINUEND_PLACES=213, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=730, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=119, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=533, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=9784, PETRI_PLACES=234, PETRI_TRANSITIONS=580} [2023-01-28 10:39:28,816 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 194 predicate places. [2023-01-28 10:39:28,816 INFO L495 AbstractCegarLoop]: Abstraction has has 234 places, 580 transitions, 9784 flow [2023-01-28 10:39:28,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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) [2023-01-28 10:39:28,816 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:39:28,816 INFO L208 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] [2023-01-28 10:39:28,825 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-01-28 10:39:29,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:39:29,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:39:29,018 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:39:29,018 INFO L85 PathProgramCache]: Analyzing trace with hash 870778556, now seen corresponding path program 9 times [2023-01-28 10:39:29,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:39:29,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042621970] [2023-01-28 10:39:29,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:39:29,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:39:29,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:39:29,377 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:39:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:39:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042621970] [2023-01-28 10:39:29,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042621970] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:39:29,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [745632782] [2023-01-28 10:39:29,378 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-01-28 10:39:29,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:39:29,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:39:29,379 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:39:29,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-01-28 10:39:29,497 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-01-28 10:39:29,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:39:29,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 33 conjunts are in the unsatisfiable core [2023-01-28 10:39:29,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:39:29,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:39:29,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:39:29,630 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:39:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:39:29,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:39:29,735 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2023-01-28 10:39:29,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2023-01-28 10:39:30,022 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:39:30,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [745632782] provided 1 perfect and 1 imperfect interpolant sequences [2023-01-28 10:39:30,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-01-28 10:39:30,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [9, 10] total 29 [2023-01-28 10:39:30,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529547667] [2023-01-28 10:39:30,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-01-28 10:39:30,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-01-28 10:39:30,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:39:30,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-01-28 10:39:30,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=751, Unknown=4, NotChecked=0, Total=930 [2023-01-28 10:39:30,024 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 296 [2023-01-28 10:39:30,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 234 places, 580 transitions, 9784 flow. Second operand has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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) [2023-01-28 10:39:30,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:39:30,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 296 [2023-01-28 10:39:30,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:39:48,759 INFO L130 PetriNetUnfolder]: 67053/94974 cut-off events. [2023-01-28 10:39:48,759 INFO L131 PetriNetUnfolder]: For 5865058/5867484 co-relation queries the response was YES. [2023-01-28 10:39:49,957 INFO L83 FinitePrefix]: Finished finitePrefix Result has 811903 conditions, 94974 events. 67053/94974 cut-off events. For 5865058/5867484 co-relation queries the response was YES. Maximal size of possible extension queue 3613. Compared 661747 event pairs, 15318 based on Foata normal form. 2243/97144 useless extension candidates. Maximal degree in co-relation 811788. Up to 25494 conditions per place. [2023-01-28 10:39:50,170 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 463 selfloop transitions, 116 changer transitions 922/1521 dead transitions. [2023-01-28 10:39:50,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 239 places, 1521 transitions, 29188 flow [2023-01-28 10:39:50,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-01-28 10:39:50,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-01-28 10:39:50,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1429 transitions. [2023-01-28 10:39:50,172 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40230855855855857 [2023-01-28 10:39:50,172 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 1429 transitions. [2023-01-28 10:39:50,172 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 1429 transitions. [2023-01-28 10:39:50,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:39:50,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 1429 transitions. [2023-01-28 10:39:50,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 119.08333333333333) internal successors, (1429), 12 states have internal predecessors, (1429), 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) [2023-01-28 10:39:50,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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) [2023-01-28 10:39:50,175 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 296.0) internal successors, (3848), 13 states have internal predecessors, (3848), 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) [2023-01-28 10:39:50,176 INFO L175 Difference]: Start difference. First operand has 234 places, 580 transitions, 9784 flow. Second operand 12 states and 1429 transitions. [2023-01-28 10:39:50,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 239 places, 1521 transitions, 29188 flow [2023-01-28 10:40:35,973 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 214 places, 1521 transitions, 27945 flow, removed 387 selfloop flow, removed 25 redundant places. [2023-01-28 10:40:35,985 INFO L231 Difference]: Finished difference. Result has 224 places, 454 transitions, 7909 flow [2023-01-28 10:40:35,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=9441, PETRI_DIFFERENCE_MINUEND_PLACES=203, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=580, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=81, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=469, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=7909, PETRI_PLACES=224, PETRI_TRANSITIONS=454} [2023-01-28 10:40:35,986 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 184 predicate places. [2023-01-28 10:40:35,986 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 454 transitions, 7909 flow [2023-01-28 10:40:35,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 107.5) internal successors, (1290), 12 states have internal predecessors, (1290), 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) [2023-01-28 10:40:35,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:40:35,987 INFO L208 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] [2023-01-28 10:40:35,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-01-28 10:40:36,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:40:36,187 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:40:36,187 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:40:36,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1030603632, now seen corresponding path program 10 times [2023-01-28 10:40:36,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:40:36,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1027591365] [2023-01-28 10:40:36,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:40:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:40:36,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:40:36,524 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-01-28 10:40:36,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:40:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1027591365] [2023-01-28 10:40:36,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1027591365] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:40:36,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2032746935] [2023-01-28 10:40:36,524 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-01-28 10:40:36,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:40:36,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:40:36,525 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:40:36,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-01-28 10:40:36,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-01-28 10:40:36,647 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:40:36,649 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 34 conjunts are in the unsatisfiable core [2023-01-28 10:40:36,652 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:40:36,657 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 426 treesize of output 410 [2023-01-28 10:40:36,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:40:36,797 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:40:36,854 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-01-28 10:40:36,884 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:40:36,884 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:40:42,323 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 53 [2023-01-28 10:40:42,325 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2023-01-28 10:40:42,328 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2023-01-28 10:40:42,355 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:40:42,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2032746935] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:40:42,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:40:42,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 28 [2023-01-28 10:40:42,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437309668] [2023-01-28 10:40:42,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:40:42,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-01-28 10:40:42,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:40:42,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-01-28 10:40:42,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=697, Unknown=16, NotChecked=0, Total=870 [2023-01-28 10:40:42,358 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 296 [2023-01-28 10:40:42,359 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 454 transitions, 7909 flow. Second operand has 30 states, 30 states have (on average 99.9) internal successors, (2997), 30 states have internal predecessors, (2997), 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) [2023-01-28 10:40:42,359 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:40:42,359 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 296 [2023-01-28 10:40:42,359 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:40:57,143 INFO L130 PetriNetUnfolder]: 53163/75321 cut-off events. [2023-01-28 10:40:57,144 INFO L131 PetriNetUnfolder]: For 3119304/3119304 co-relation queries the response was YES. [2023-01-28 10:40:57,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 588518 conditions, 75321 events. 53163/75321 cut-off events. For 3119304/3119304 co-relation queries the response was YES. Maximal size of possible extension queue 2808. Compared 506924 event pairs, 3633 based on Foata normal form. 79/75399 useless extension candidates. Maximal degree in co-relation 588417. Up to 20076 conditions per place. [2023-01-28 10:40:57,921 INFO L137 encePairwiseOnDemand]: 285/296 looper letters, 385 selfloop transitions, 83 changer transitions 1008/1476 dead transitions. [2023-01-28 10:40:57,921 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 267 places, 1476 transitions, 27804 flow [2023-01-28 10:40:57,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2023-01-28 10:40:57,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2023-01-28 10:40:57,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 5185 transitions. [2023-01-28 10:40:57,925 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.36493524774774777 [2023-01-28 10:40:57,925 INFO L72 ComplementDD]: Start complementDD. Operand 48 states and 5185 transitions. [2023-01-28 10:40:57,925 INFO L73 IsDeterministic]: Start isDeterministic. Operand 48 states and 5185 transitions. [2023-01-28 10:40:57,926 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:40:57,926 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 48 states and 5185 transitions. [2023-01-28 10:40:57,930 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 49 states, 48 states have (on average 108.02083333333333) internal successors, (5185), 48 states have internal predecessors, (5185), 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) [2023-01-28 10:40:57,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 49 states, 49 states have (on average 296.0) internal successors, (14504), 49 states have internal predecessors, (14504), 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) [2023-01-28 10:40:57,937 INFO L81 ComplementDD]: Finished complementDD. Result has 49 states, 49 states have (on average 296.0) internal successors, (14504), 49 states have internal predecessors, (14504), 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) [2023-01-28 10:40:57,937 INFO L175 Difference]: Start difference. First operand has 224 places, 454 transitions, 7909 flow. Second operand 48 states and 5185 transitions. [2023-01-28 10:40:57,937 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 267 places, 1476 transitions, 27804 flow [2023-01-28 10:41:11,781 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 261 places, 1476 transitions, 27527 flow, removed 134 selfloop flow, removed 6 redundant places. [2023-01-28 10:41:11,793 INFO L231 Difference]: Finished difference. Result has 301 places, 345 transitions, 6614 flow [2023-01-28 10:41:11,793 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=7874, PETRI_DIFFERENCE_MINUEND_PLACES=214, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=454, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=406, PETRI_DIFFERENCE_SUBTRAHEND_STATES=48, PETRI_FLOW=6614, PETRI_PLACES=301, PETRI_TRANSITIONS=345} [2023-01-28 10:41:11,793 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 261 predicate places. [2023-01-28 10:41:11,793 INFO L495 AbstractCegarLoop]: Abstraction has has 301 places, 345 transitions, 6614 flow [2023-01-28 10:41:11,794 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 99.9) internal successors, (2997), 30 states have internal predecessors, (2997), 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) [2023-01-28 10:41:11,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:41:11,794 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:41:11,799 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-01-28 10:41:11,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-01-28 10:41:11,994 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:41:11,995 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:41:11,995 INFO L85 PathProgramCache]: Analyzing trace with hash -793896260, now seen corresponding path program 11 times [2023-01-28 10:41:11,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:41:11,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832140156] [2023-01-28 10:41:11,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:41:11,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:41:12,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:41:12,076 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:41:12,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:41:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832140156] [2023-01-28 10:41:12,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832140156] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:41:12,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522499673] [2023-01-28 10:41:12,076 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-01-28 10:41:12,076 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:41:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:41:12,077 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:41:12,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-01-28 10:41:12,178 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:41:12,178 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:41:12,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:41:12,179 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:41:12,233 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:41:12,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:41:12,276 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-01-28 10:41:12,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522499673] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:41:12,276 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:41:12,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 13 [2023-01-28 10:41:12,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59244592] [2023-01-28 10:41:12,277 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:41:12,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-01-28 10:41:12,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:41:12,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-01-28 10:41:12,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2023-01-28 10:41:12,278 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 10:41:12,279 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 301 places, 345 transitions, 6614 flow. Second operand has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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) [2023-01-28 10:41:12,279 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:41:12,279 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 10:41:12,279 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:41:18,098 INFO L130 PetriNetUnfolder]: 20974/30557 cut-off events. [2023-01-28 10:41:18,099 INFO L131 PetriNetUnfolder]: For 2539437/2539437 co-relation queries the response was YES. [2023-01-28 10:41:18,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 307618 conditions, 30557 events. 20974/30557 cut-off events. For 2539437/2539437 co-relation queries the response was YES. Maximal size of possible extension queue 1089. Compared 193014 event pairs, 4608 based on Foata normal form. 211/30766 useless extension candidates. Maximal degree in co-relation 307495. Up to 14637 conditions per place. [2023-01-28 10:41:18,430 INFO L137 encePairwiseOnDemand]: 290/296 looper letters, 431 selfloop transitions, 4 changer transitions 207/642 dead transitions. [2023-01-28 10:41:18,430 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 241 places, 642 transitions, 13079 flow [2023-01-28 10:41:18,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-01-28 10:41:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-01-28 10:41:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1014 transitions. [2023-01-28 10:41:18,432 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4282094594594595 [2023-01-28 10:41:18,432 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1014 transitions. [2023-01-28 10:41:18,432 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1014 transitions. [2023-01-28 10:41:18,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:41:18,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1014 transitions. [2023-01-28 10:41:18,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 126.75) internal successors, (1014), 8 states have internal predecessors, (1014), 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) [2023-01-28 10:41:18,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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) [2023-01-28 10:41:18,435 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 296.0) internal successors, (2664), 9 states have internal predecessors, (2664), 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) [2023-01-28 10:41:18,435 INFO L175 Difference]: Start difference. First operand has 301 places, 345 transitions, 6614 flow. Second operand 8 states and 1014 transitions. [2023-01-28 10:41:18,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 241 places, 642 transitions, 13079 flow [2023-01-28 10:41:25,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 192 places, 642 transitions, 10962 flow, removed 905 selfloop flow, removed 49 redundant places. [2023-01-28 10:41:25,501 INFO L231 Difference]: Finished difference. Result has 196 places, 346 transitions, 5748 flow [2023-01-28 10:41:25,502 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5536, PETRI_DIFFERENCE_MINUEND_PLACES=185, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=345, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=341, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=5748, PETRI_PLACES=196, PETRI_TRANSITIONS=346} [2023-01-28 10:41:25,502 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 156 predicate places. [2023-01-28 10:41:25,502 INFO L495 AbstractCegarLoop]: Abstraction has has 196 places, 346 transitions, 5748 flow [2023-01-28 10:41:25,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 119.35714285714286) internal successors, (1671), 14 states have internal predecessors, (1671), 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) [2023-01-28 10:41:25,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:41:25,502 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:41:25,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-01-28 10:41:25,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-01-28 10:41:25,706 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:41:25,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:41:25,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1994142562, now seen corresponding path program 12 times [2023-01-28 10:41:25,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:41:25,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548330435] [2023-01-28 10:41:25,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:41:25,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:41:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:41:25,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:41:25,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:41:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548330435] [2023-01-28 10:41:25,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548330435] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:41:25,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570412897] [2023-01-28 10:41:25,816 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-01-28 10:41:25,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:41:25,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:41:25,817 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:41:25,849 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-01-28 10:41:25,947 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2023-01-28 10:41:25,948 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:41:25,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:41:25,950 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:41:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:41:26,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:41:26,052 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2023-01-28 10:41:26,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570412897] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:41:26,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:41:26,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-01-28 10:41:26,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348165907] [2023-01-28 10:41:26,052 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:41:26,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 10:41:26,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:41:26,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 10:41:26,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-01-28 10:41:26,054 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 10:41:26,054 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 196 places, 346 transitions, 5748 flow. Second operand has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 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) [2023-01-28 10:41:26,054 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:41:26,055 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 10:41:26,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:41:32,081 INFO L130 PetriNetUnfolder]: 24819/35244 cut-off events. [2023-01-28 10:41:32,081 INFO L131 PetriNetUnfolder]: For 1518355/1518626 co-relation queries the response was YES. [2023-01-28 10:41:32,382 INFO L83 FinitePrefix]: Finished finitePrefix Result has 309383 conditions, 35244 events. 24819/35244 cut-off events. For 1518355/1518626 co-relation queries the response was YES. Maximal size of possible extension queue 1358. Compared 216279 event pairs, 8707 based on Foata normal form. 2365/37592 useless extension candidates. Maximal degree in co-relation 309295. Up to 24995 conditions per place. [2023-01-28 10:41:32,503 INFO L137 encePairwiseOnDemand]: 291/296 looper letters, 405 selfloop transitions, 85 changer transitions 0/504 dead transitions. [2023-01-28 10:41:32,504 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 504 transitions, 9662 flow [2023-01-28 10:41:32,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 10:41:32,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 10:41:32,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 875 transitions. [2023-01-28 10:41:32,505 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4222972972972973 [2023-01-28 10:41:32,505 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 875 transitions. [2023-01-28 10:41:32,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 875 transitions. [2023-01-28 10:41:32,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:41:32,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 875 transitions. [2023-01-28 10:41:32,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 125.0) internal successors, (875), 7 states have internal predecessors, (875), 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) [2023-01-28 10:41:32,507 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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) [2023-01-28 10:41:32,507 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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) [2023-01-28 10:41:32,507 INFO L175 Difference]: Start difference. First operand has 196 places, 346 transitions, 5748 flow. Second operand 7 states and 875 transitions. [2023-01-28 10:41:32,507 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 504 transitions, 9662 flow [2023-01-28 10:41:42,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 176 places, 504 transitions, 9017 flow, removed 319 selfloop flow, removed 23 redundant places. [2023-01-28 10:41:42,968 INFO L231 Difference]: Finished difference. Result has 177 places, 347 transitions, 5619 flow [2023-01-28 10:41:42,969 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5375, PETRI_DIFFERENCE_MINUEND_PLACES=170, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=346, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=261, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5619, PETRI_PLACES=177, PETRI_TRANSITIONS=347} [2023-01-28 10:41:42,969 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 137 predicate places. [2023-01-28 10:41:42,969 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 347 transitions, 5619 flow [2023-01-28 10:41:42,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 119.0) internal successors, (1785), 15 states have internal predecessors, (1785), 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) [2023-01-28 10:41:42,969 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:41:42,969 INFO L208 CegarLoopForPetriNet]: trace histogram [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] [2023-01-28 10:41:42,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-01-28 10:41:43,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-01-28 10:41:43,170 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:41:43,170 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:41:43,170 INFO L85 PathProgramCache]: Analyzing trace with hash 1061762819, now seen corresponding path program 13 times [2023-01-28 10:41:43,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:41:43,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223648922] [2023-01-28 10:41:43,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:41:43,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:41:43,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:41:43,263 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:41:43,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:41:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1223648922] [2023-01-28 10:41:43,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1223648922] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:41:43,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006568472] [2023-01-28 10:41:43,263 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-01-28 10:41:43,263 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:41:43,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:41:43,264 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:41:43,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-01-28 10:41:43,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:41:43,366 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 8 conjunts are in the unsatisfiable core [2023-01-28 10:41:43,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:41:43,423 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:41:43,423 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:41:43,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:41:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006568472] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:41:43,481 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:41:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 14 [2023-01-28 10:41:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610959435] [2023-01-28 10:41:43,482 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:41:43,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-01-28 10:41:43,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:41:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-01-28 10:41:43,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2023-01-28 10:41:43,484 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 296 [2023-01-28 10:41:43,485 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 347 transitions, 5619 flow. Second operand has 15 states, 15 states have (on average 118.86666666666666) internal successors, (1783), 15 states have internal predecessors, (1783), 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) [2023-01-28 10:41:43,485 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:41:43,485 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 296 [2023-01-28 10:41:43,485 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:41:49,201 INFO L130 PetriNetUnfolder]: 27944/39466 cut-off events. [2023-01-28 10:41:49,202 INFO L131 PetriNetUnfolder]: For 712057/712327 co-relation queries the response was YES. [2023-01-28 10:41:49,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285964 conditions, 39466 events. 27944/39466 cut-off events. For 712057/712327 co-relation queries the response was YES. Maximal size of possible extension queue 1435. Compared 241616 event pairs, 8956 based on Foata normal form. 2716/42164 useless extension candidates. Maximal degree in co-relation 285896. Up to 23971 conditions per place. [2023-01-28 10:41:49,607 INFO L137 encePairwiseOnDemand]: 291/296 looper letters, 368 selfloop transitions, 44 changer transitions 5/431 dead transitions. [2023-01-28 10:41:49,607 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 183 places, 431 transitions, 7942 flow [2023-01-28 10:41:49,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-01-28 10:41:49,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-01-28 10:41:49,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 869 transitions. [2023-01-28 10:41:49,608 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4194015444015444 [2023-01-28 10:41:49,608 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 869 transitions. [2023-01-28 10:41:49,608 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 869 transitions. [2023-01-28 10:41:49,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-01-28 10:41:49,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 869 transitions. [2023-01-28 10:41:49,609 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.14285714285714) internal successors, (869), 7 states have internal predecessors, (869), 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) [2023-01-28 10:41:49,610 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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) [2023-01-28 10:41:49,611 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 296.0) internal successors, (2368), 8 states have internal predecessors, (2368), 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) [2023-01-28 10:41:49,611 INFO L175 Difference]: Start difference. First operand has 177 places, 347 transitions, 5619 flow. Second operand 7 states and 869 transitions. [2023-01-28 10:41:49,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 183 places, 431 transitions, 7942 flow [2023-01-28 10:41:51,482 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 178 places, 431 transitions, 7749 flow, removed 22 selfloop flow, removed 5 redundant places. [2023-01-28 10:41:51,487 INFO L231 Difference]: Finished difference. Result has 179 places, 348 transitions, 5598 flow [2023-01-28 10:41:51,487 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=296, PETRI_DIFFERENCE_MINUEND_FLOW=5467, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=347, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=5598, PETRI_PLACES=179, PETRI_TRANSITIONS=348} [2023-01-28 10:41:51,487 INFO L281 CegarLoopForPetriNet]: 40 programPoint places, 139 predicate places. [2023-01-28 10:41:51,487 INFO L495 AbstractCegarLoop]: Abstraction has has 179 places, 348 transitions, 5598 flow [2023-01-28 10:41:51,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 118.86666666666666) internal successors, (1783), 15 states have internal predecessors, (1783), 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) [2023-01-28 10:41:51,488 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-01-28 10:41:51,488 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-01-28 10:41:51,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-01-28 10:41:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-01-28 10:41:51,692 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-01-28 10:41:51,692 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-01-28 10:41:51,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1759637409, now seen corresponding path program 14 times [2023-01-28 10:41:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-01-28 10:41:51,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311012325] [2023-01-28 10:41:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-01-28 10:41:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-01-28 10:41:51,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-01-28 10:41:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:41:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-01-28 10:41:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311012325] [2023-01-28 10:41:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311012325] provided 0 perfect and 1 imperfect interpolant sequences [2023-01-28 10:41:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640079091] [2023-01-28 10:41:52,241 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-01-28 10:41:52,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-01-28 10:41:52,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-01-28 10:41:52,242 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-01-28 10:41:52,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-01-28 10:41:52,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-01-28 10:41:52,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-01-28 10:41:52,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 41 conjunts are in the unsatisfiable core [2023-01-28 10:41:52,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-01-28 10:41:52,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:41:52,540 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:41:52,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:41:52,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-01-28 10:41:52,788 INFO L321 Elim1Store]: treesize reduction 14, result has 61.1 percent of original size [2023-01-28 10:41:52,788 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 40 [2023-01-28 10:41:52,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:41:52,830 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2023-01-28 10:41:52,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-01-28 10:41:52,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2023-01-28 10:41:52,891 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-01-28 10:41:52,945 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-01-28 10:41:52,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-01-28 10:41:53,124 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse0 (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset) v_ArrVal_1012) c_~A~0.offset))) (or (< c_~min~0 (+ 2 .cse0)) (< 2147483646 .cse0))))) is different from false [2023-01-28 10:41:53,150 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base)) (.cse2 (+ (* 4 |c_thread3Thread1of1ForFork0_~i~2#1|) c_~A~0.offset))) (let ((.cse0 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 .cse2 v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse0) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| (+ 1 |c_thread3Thread1of1ForFork0_~i~2#1|)) (< (+ v_ArrVal_1008 1) (select .cse1 .cse2)) (< c_~min~0 (+ 2 .cse0))))))) is different from false [2023-01-28 10:41:53,169 WARN L839 $PredicateComparison]: unable to prove that (or (= (mod c_~b1~0 256) 0) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse1 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse1 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse0) (< (+ v_ArrVal_1008 1) (select .cse1 c_~A~0.offset)) (< c_~min~0 (+ .cse0 2)) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1)))))) is different from false [2023-01-28 10:41:53,277 WARN L839 $PredicateComparison]: unable to prove that (or (let ((.cse3 (select |c_#memory_int| c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset))) (and (forall ((v_ArrVal_1008 Int)) (or (< (+ v_ArrVal_1008 1) .cse0) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_67| Int)) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse1 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse1) (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< c_~min~0 .cse2) (< .cse2 (+ .cse1 2)))))))))))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (<= (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) c_~min~0)) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse4 (select (store (select (store (store |c_#memory_int| c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< 2147483646 .cse4) (< (+ v_ArrVal_1008 1) .cse0) (< c_~min~0 (+ .cse4 2)) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1)))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-01-28 10:41:53,393 WARN L839 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1007 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse0 (select .cse2 c_~A~0.base))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (<= (select .cse0 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))) c_~min~0)) (forall ((v_ArrVal_1012 Int) (|v_thread3Thread1of1ForFork0_~i~2#1_67| Int) (v_ArrVal_1010 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse1 (select (store (select (store (store .cse2 c_~A~0.base (store .cse0 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (< (+ v_ArrVal_1008 1) (select .cse0 c_~A~0.offset)) (< c_~min~0 (+ 2 .cse1)) (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (< 2147483646 .cse1)))))))) (forall ((v_ArrVal_1007 (Array Int Int)) (v_ArrVal_1008 Int)) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_1007))) (let ((.cse3 (select .cse6 c_~A~0.base))) (or (< (+ v_ArrVal_1008 1) (select .cse3 c_~A~0.offset)) (forall ((|v_thread3Thread1of1ForFork0_~i~2#1_67| Int)) (or (< |v_thread3Thread1of1ForFork0_~i~2#1_67| 1) (forall ((v_ArrVal_1012 Int) (v_ArrVal_1010 (Array Int Int))) (let ((.cse5 (select (store (select (store (store .cse6 c_~A~0.base (store .cse3 c_~A~0.offset v_ArrVal_1008)) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_1010) c_~A~0.base) (+ c_~A~0.offset (* |v_thread3Thread1of1ForFork0_~i~2#1_67| 4)) v_ArrVal_1012) c_~A~0.offset))) (or (forall ((thread1Thread1of1ForFork1_~i~0 Int)) (let ((.cse4 (select .cse3 (+ c_~A~0.offset (* thread1Thread1of1ForFork1_~i~0 4))))) (or (< .cse4 (+ 2 .cse5)) (< c_~min~0 .cse4)))) (< 2147483646 .cse5))))))))))) (= (mod c_~b1~0 256) 0)) is different from false [2023-01-28 10:41:56,541 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1141 treesize of output 1077 [2023-01-28 10:41:56,556 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,569 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:41:56,570 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 209 treesize of output 201 [2023-01-28 10:41:56,581 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,589 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:41:56,590 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 341 treesize of output 317 [2023-01-28 10:41:56,598 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,606 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-01-28 10:41:56,606 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 193 treesize of output 193 [2023-01-28 10:41:56,618 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 315 [2023-01-28 10:41:56,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,933 INFO L173 IndexEqualityManager]: detected equality via solver [2023-01-28 10:41:56,935 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 57 [2023-01-28 10:41:56,939 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-01-28 10:41:56,939 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 65 treesize of output 1 [2023-01-28 10:41:57,011 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 5 not checked. [2023-01-28 10:41:57,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640079091] provided 0 perfect and 2 imperfect interpolant sequences [2023-01-28 10:41:57,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-01-28 10:41:57,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 41 [2023-01-28 10:41:57,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587262036] [2023-01-28 10:41:57,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-01-28 10:41:57,011 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-01-28 10:41:57,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-01-28 10:41:57,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-01-28 10:41:57,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=1192, Unknown=20, NotChecked=380, Total=1806 [2023-01-28 10:41:57,014 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 296 [2023-01-28 10:41:57,015 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 179 places, 348 transitions, 5598 flow. Second operand has 43 states, 43 states have (on average 97.30232558139535) internal successors, (4184), 43 states have internal predecessors, (4184), 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) [2023-01-28 10:41:57,015 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-01-28 10:41:57,015 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 296 [2023-01-28 10:41:57,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-01-28 10:42:01,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 [1] [2023-01-28 10:42:18,413 WARN L222 SmtUtils]: Spent 15.93s on a formula simplification. DAG size of input: 114 DAG size of output: 87 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:42:27,141 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 [1] [2023-01-28 10:42:29,185 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 [1] [2023-01-28 10:42:31,445 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 [1] [2023-01-28 10:42:33,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 [1] [2023-01-28 10:42:35,467 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 [1] [2023-01-28 10:42:40,481 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 [1] [2023-01-28 10:42:49,318 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 [1] [2023-01-28 10:43:15,810 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 [1] [2023-01-28 10:43:34,201 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 [1] [2023-01-28 10:43:36,205 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 [1] [2023-01-28 10:43:38,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 [1] [2023-01-28 10:43:40,241 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 [1] [2023-01-28 10:43:42,253 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 [1] [2023-01-28 10:43:44,259 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 [1] [2023-01-28 10:43:46,589 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 [1] [2023-01-28 10:43:48,609 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 [1] [2023-01-28 10:44:03,659 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 [1] [2023-01-28 10:44:05,697 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 [1] [2023-01-28 10:44:07,724 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 [1] [2023-01-28 10:44:09,726 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, 1] [2023-01-28 10:44:11,729 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 [1] [2023-01-28 10:44:13,734 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 [1] [2023-01-28 10:44:32,540 WARN L222 SmtUtils]: Spent 6.74s on a formula simplification. DAG size of input: 80 DAG size of output: 76 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-01-28 10:44:34,545 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 [1] [2023-01-28 10:44:36,562 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 [1] [2023-01-28 10:44:38,587 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 [1] [2023-01-28 10:44:40,588 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 [1] [2023-01-28 10:44:50,712 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 [1] Received shutdown request... [2023-01-28 10:44:52,363 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2023-01-28 10:44:52,365 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 [2023-01-28 10:44:53,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-01-28 10:44:53,023 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 5 remaining) [2023-01-28 10:44:53,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2023-01-28 10:44:53,223 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-01-28 10:44:53,223 WARN L619 AbstractCegarLoop]: Verification canceled: while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. [2023-01-28 10:44:53,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 5 remaining) [2023-01-28 10:44:53,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 5 remaining) [2023-01-28 10:44:53,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 5 remaining) [2023-01-28 10:44:53,225 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 5 remaining) [2023-01-28 10:44:53,225 INFO L445 BasicCegarLoop]: Path program histogram: [14, 1, 1, 1, 1] [2023-01-28 10:44:53,227 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-01-28 10:44:53,227 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-01-28 10:44:53,228 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.01 10:44:53 BasicIcfg [2023-01-28 10:44:53,229 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-01-28 10:44:53,229 INFO L158 Benchmark]: Toolchain (without parser) took 824231.03ms. Allocated memory was 352.3MB in the beginning and 14.5GB in the end (delta: 14.2GB). Free memory was 322.9MB in the beginning and 12.4GB in the end (delta: -12.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-28 10:44:53,229 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 255.9MB. Free memory was 212.4MB in the beginning and 212.2MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.0GB. [2023-01-28 10:44:53,229 INFO L158 Benchmark]: CACSL2BoogieTranslator took 152.69ms. Allocated memory is still 352.3MB. Free memory was 322.9MB in the beginning and 310.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. [2023-01-28 10:44:53,229 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.70ms. Allocated memory is still 352.3MB. Free memory was 310.9MB in the beginning and 308.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:44:53,229 INFO L158 Benchmark]: Boogie Preprocessor took 18.36ms. Allocated memory is still 352.3MB. Free memory was 308.8MB in the beginning and 307.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2023-01-28 10:44:53,230 INFO L158 Benchmark]: RCFGBuilder took 419.70ms. Allocated memory is still 352.3MB. Free memory was 307.2MB in the beginning and 282.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. [2023-01-28 10:44:53,230 INFO L158 Benchmark]: TraceAbstraction took 823610.31ms. Allocated memory was 352.3MB in the beginning and 14.5GB in the end (delta: 14.2GB). Free memory was 281.6MB in the beginning and 12.4GB in the end (delta: -12.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. [2023-01-28 10:44:53,230 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.10ms. Allocated memory is still 255.9MB. Free memory was 212.4MB in the beginning and 212.2MB in the end (delta: 169.3kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 152.69ms. Allocated memory is still 352.3MB. Free memory was 322.9MB in the beginning and 310.9MB in the end (delta: 12.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 24.70ms. Allocated memory is still 352.3MB. Free memory was 310.9MB in the beginning and 308.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 18.36ms. Allocated memory is still 352.3MB. Free memory was 308.8MB in the beginning and 307.2MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 419.70ms. Allocated memory is still 352.3MB. Free memory was 307.2MB in the beginning and 282.5MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.0GB. * TraceAbstraction took 823610.31ms. Allocated memory was 352.3MB in the beginning and 14.5GB in the end (delta: 14.2GB). Free memory was 281.6MB in the beginning and 12.4GB in the end (delta: -12.1GB). Peak memory consumption was 2.1GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.9s, 147 PlacesBefore, 40 PlacesAfterwards, 146 TransitionsBefore, 31 TransitionsAfterwards, 2280 CoEnabledTransitionPairs, 7 FixpointIterations, 67 TrivialSequentialCompositions, 36 ConcurrentSequentialCompositions, 17 TrivialYvCompositions, 6 ConcurrentYvCompositions, 8 ChoiceCompositions, 134 TotalNumberOfCompositions, 3482 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 2552, independent: 2466, independent conditional: 0, independent unconditional: 2466, dependent: 86, dependent conditional: 0, dependent unconditional: 86, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1219, independent: 1190, independent conditional: 0, independent unconditional: 1190, dependent: 29, dependent conditional: 0, dependent unconditional: 29, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 2552, independent: 1276, independent conditional: 0, independent unconditional: 1276, dependent: 57, dependent conditional: 0, dependent unconditional: 57, unknown: 1219, unknown conditional: 0, unknown unconditional: 1219] , Statistics on independence cache: Total cache size (in pairs): 107, Positive cache size: 97, Positive conditional cache size: 0, Positive unconditional cache size: 97, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - TimeoutResultAtElement [Line: 120]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 113]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while PredicateComparison was comparing new predicate (quantified with 0quantifier alternations) to 71 known predicates. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 190 locations, 5 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 823.5s, OverallIterations: 18, TraceHistogramMax: 2, PathProgramHistogramMax: 14, EmptinessCheckTime: 0.0s, AutomataDifference: 784.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 4.0s, HoareTripleCheckerStatistics: 27 mSolverCounterUnknown, 5234 SdHoareTripleChecker+Valid, 68.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5234 mSDsluCounter, 347 SdHoareTripleChecker+Invalid, 66.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 4276 IncrementalHoareTripleChecker+Unchecked, 305 mSDsCounter, 514 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14514 IncrementalHoareTripleChecker+Invalid, 19331 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 514 mSolverCounterUnsat, 42 mSDtfsCounter, 14514 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1297 GetRequests, 565 SyntacticMatches, 36 SemanticMatches, 695 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 20115 ImplicationChecksByTransitivity, 263.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10845occurred in iteration=11, InterpolantAutomatonStates: 421, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 30.4s InterpolantComputationTime, 940 NumberOfCodeBlocks, 940 NumberOfCodeBlocksAsserted, 42 NumberOfCheckSat, 1280 ConstructedInterpolants, 60 QuantifiedInterpolants, 13698 SizeOfPredicates, 175 NumberOfNonLiveVariables, 3567 ConjunctsInSsa, 338 ConjunctsInUnsatCore, 42 InterpolantComputations, 9 PerfectInterpolantSequences, 131/218 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