/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf --traceabstraction.use.on-demand.petri.net.difference true --traceabstraction.size.reduction.to.apply.after.petri.net.difference REMOVE_REDUNDANT_FLOW -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-wip.dk.repeated-lipton-a802222-m [2022-12-12 13:54:11,373 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-12 13:54:11,375 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-12 13:54:11,434 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-12 13:54:11,434 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-12 13:54:11,437 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-12 13:54:11,440 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-12 13:54:11,443 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-12 13:54:11,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-12 13:54:11,452 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-12 13:54:11,453 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-12 13:54:11,455 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-12 13:54:11,455 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-12 13:54:11,457 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-12 13:54:11,458 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-12 13:54:11,461 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-12 13:54:11,462 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-12 13:54:11,462 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-12 13:54:11,465 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-12 13:54:11,470 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-12 13:54:11,471 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-12 13:54:11,472 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-12 13:54:11,473 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-12 13:54:11,474 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-12 13:54:11,480 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-12 13:54:11,481 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-12 13:54:11,481 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-12 13:54:11,483 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-12 13:54:11,483 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-12 13:54:11,484 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-12 13:54:11,484 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-12 13:54:11,486 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-12 13:54:11,487 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-12 13:54:11,487 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-12 13:54:11,488 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-12 13:54:11,488 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-12 13:54:11,489 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-12 13:54:11,489 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-12 13:54:11,489 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-12 13:54:11,490 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-12 13:54:11,491 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-12 13:54:11,492 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe.epf [2022-12-12 13:54:11,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-12 13:54:11,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-12 13:54:11,526 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-12 13:54:11,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-12 13:54:11,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-12 13:54:11,527 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-12 13:54:11,527 INFO L138 SettingsManager]: * Use SBE=true [2022-12-12 13:54:11,528 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-12 13:54:11,528 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-12 13:54:11,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-12 13:54:11,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-12 13:54:11,530 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-12 13:54:11,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-12 13:54:11,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-12 13:54:11,530 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-12-12 13:54:11,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-12 13:54:11,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:54:11,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-12 13:54:11,531 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use on-demand Petri net difference -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Size reduction to apply after Petri net difference -> REMOVE_REDUNDANT_FLOW [2022-12-12 13:54:11,850 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-12 13:54:11,866 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-12 13:54:11,869 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-12 13:54:11,869 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-12 13:54:11,875 INFO L275 PluginConnector]: CDTParser initialized [2022-12-12 13:54:11,877 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-12 13:54:12,944 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-12 13:54:13,168 INFO L351 CDTParser]: Found 1 translation units. [2022-12-12 13:54:13,168 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c [2022-12-12 13:54:13,174 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56d87bd5/41c3732482a34aaf92e4a4aa1c204371/FLAGdd8afb224 [2022-12-12 13:54:13,186 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d56d87bd5/41c3732482a34aaf92e4a4aa1c204371 [2022-12-12 13:54:13,189 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-12 13:54:13,190 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-12-12 13:54:13,193 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-12 13:54:13,193 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-12 13:54:13,195 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-12 13:54:13,196 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,197 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e95bdec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13, skipping insertion in model container [2022-12-12 13:54:13,197 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,203 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-12 13:54:13,227 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-12 13:54:13,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-12 13:54:13,385 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:54:13,394 INFO L203 MainTranslator]: Completed pre-run [2022-12-12 13:54:13,429 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/unroll-3.wvr.c[2500,2513] [2022-12-12 13:54:13,432 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-12 13:54:13,448 INFO L208 MainTranslator]: Completed translation [2022-12-12 13:54:13,450 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13 WrapperNode [2022-12-12 13:54:13,450 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-12 13:54:13,452 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-12 13:54:13,452 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-12 13:54:13,452 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-12 13:54:13,458 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,475 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,506 INFO L138 Inliner]: procedures = 24, calls = 34, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 144 [2022-12-12 13:54:13,507 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-12 13:54:13,508 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-12 13:54:13,509 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-12 13:54:13,509 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-12 13:54:13,516 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,516 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,531 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,531 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,536 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,540 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,541 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,553 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,555 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-12 13:54:13,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-12 13:54:13,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-12 13:54:13,556 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-12 13:54:13,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (1/1) ... [2022-12-12 13:54:13,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-12 13:54:13,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:54:13,594 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-12 13:54:13,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-12 13:54:13,634 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-12-12 13:54:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-12-12 13:54:13,635 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-12-12 13:54:13,635 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-12 13:54:13,636 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-12 13:54:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-12-12 13:54:13,637 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-12-12 13:54:13,638 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2022-12-12 13:54:13,760 INFO L236 CfgBuilder]: Building ICFG [2022-12-12 13:54:13,762 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-12 13:54:14,060 INFO L277 CfgBuilder]: Performing block encoding [2022-12-12 13:54:14,068 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-12 13:54:14,068 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2022-12-12 13:54:14,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:54:14 BoogieIcfgContainer [2022-12-12 13:54:14,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-12 13:54:14,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-12 13:54:14,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-12 13:54:14,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-12 13:54:14,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.12 01:54:13" (1/3) ... [2022-12-12 13:54:14,076 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1baa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:54:14, skipping insertion in model container [2022-12-12 13:54:14,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.12 01:54:13" (2/3) ... [2022-12-12 13:54:14,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b1baa84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.12 01:54:14, skipping insertion in model container [2022-12-12 13:54:14,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.12 01:54:14" (3/3) ... [2022-12-12 13:54:14,078 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-3.wvr.c [2022-12-12 13:54:14,093 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-12 13:54:14,094 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-12 13:54:14,094 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-12-12 13:54:14,163 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-12-12 13:54:14,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 159 places, 167 transitions, 350 flow [2022-12-12 13:54:14,264 INFO L130 PetriNetUnfolder]: 15/165 cut-off events. [2022-12-12 13:54:14,265 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:54:14,270 INFO L83 FinitePrefix]: Finished finitePrefix Result has 174 conditions, 165 events. 15/165 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 165 event pairs, 0 based on Foata normal form. 0/149 useless extension candidates. Maximal degree in co-relation 97. Up to 2 conditions per place. [2022-12-12 13:54:14,270 INFO L82 GeneralOperation]: Start removeDead. Operand has 159 places, 167 transitions, 350 flow [2022-12-12 13:54:14,275 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 149 places, 157 transitions, 326 flow [2022-12-12 13:54:14,285 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-12 13:54:14,290 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;@5b770343, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, Conditionality=CONDITIONAL_DISJUNCTIVE, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-12-12 13:54:14,291 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-12-12 13:54:14,323 INFO L130 PetriNetUnfolder]: 13/140 cut-off events. [2022-12-12 13:54:14,323 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-12-12 13:54:14,324 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:14,324 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:14,325 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:14,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:14,329 INFO L85 PathProgramCache]: Analyzing trace with hash 718918939, now seen corresponding path program 1 times [2022-12-12 13:54:14,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:14,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281243881] [2022-12-12 13:54:14,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:14,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:15,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:54:15,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:15,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281243881] [2022-12-12 13:54:15,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281243881] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:15,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:15,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-12-12 13:54:15,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784930142] [2022-12-12 13:54:15,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:15,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-12-12 13:54:15,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:15,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-12-12 13:54:15,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-12-12 13:54:15,088 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 167 [2022-12-12 13:54:15,093 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 149 places, 157 transitions, 326 flow. Second operand has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:15,094 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:15,094 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 167 [2022-12-12 13:54:15,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:15,276 INFO L130 PetriNetUnfolder]: 20/272 cut-off events. [2022-12-12 13:54:15,276 INFO L131 PetriNetUnfolder]: For 33/34 co-relation queries the response was YES. [2022-12-12 13:54:15,278 INFO L83 FinitePrefix]: Finished finitePrefix Result has 365 conditions, 272 events. 20/272 cut-off events. For 33/34 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 652 event pairs, 7 based on Foata normal form. 29/273 useless extension candidates. Maximal degree in co-relation 205. Up to 60 conditions per place. [2022-12-12 13:54:15,280 INFO L137 encePairwiseOnDemand]: 147/167 looper letters, 37 selfloop transitions, 7 changer transitions 5/149 dead transitions. [2022-12-12 13:54:15,280 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 149 transitions, 408 flow [2022-12-12 13:54:15,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-12-12 13:54:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-12-12 13:54:15,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 935 transitions. [2022-12-12 13:54:15,300 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.6998502994011976 [2022-12-12 13:54:15,303 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 7 predicate places. [2022-12-12 13:54:15,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 149 transitions, 408 flow [2022-12-12 13:54:15,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 147 places, 149 transitions, 337 flow, removed 27 selfloop flow, removed 9 redundant places. [2022-12-12 13:54:15,311 INFO L495 AbstractCegarLoop]: Abstraction has has 147 places, 149 transitions, 337 flow [2022-12-12 13:54:15,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 113.0) internal successors, (904), 8 states have internal predecessors, (904), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:15,312 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:15,312 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:15,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-12 13:54:15,313 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:15,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:15,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2066791413, now seen corresponding path program 1 times [2022-12-12 13:54:15,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:15,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881000031] [2022-12-12 13:54:15,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:15,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:15,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:15,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:15,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:15,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881000031] [2022-12-12 13:54:15,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881000031] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:15,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:15,598 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:54:15,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233412896] [2022-12-12 13:54:15,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:15,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:54:15,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:15,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:54:15,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:54:15,603 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 167 [2022-12-12 13:54:15,604 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 147 places, 149 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:15,604 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:15,604 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 167 [2022-12-12 13:54:15,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:15,872 INFO L130 PetriNetUnfolder]: 97/621 cut-off events. [2022-12-12 13:54:15,873 INFO L131 PetriNetUnfolder]: For 120/130 co-relation queries the response was YES. [2022-12-12 13:54:15,878 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 621 events. 97/621 cut-off events. For 120/130 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 3263 event pairs, 29 based on Foata normal form. 0/563 useless extension candidates. Maximal degree in co-relation 550. Up to 106 conditions per place. [2022-12-12 13:54:15,882 INFO L137 encePairwiseOnDemand]: 155/167 looper letters, 59 selfloop transitions, 5 changer transitions 11/181 dead transitions. [2022-12-12 13:54:15,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 155 places, 181 transitions, 578 flow [2022-12-12 13:54:15,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-12-12 13:54:15,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-12-12 13:54:15,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1075 transitions. [2022-12-12 13:54:15,886 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.7152361942781105 [2022-12-12 13:54:15,888 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 6 predicate places. [2022-12-12 13:54:15,891 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 155 places, 181 transitions, 578 flow [2022-12-12 13:54:15,899 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 155 places, 181 transitions, 544 flow, removed 17 selfloop flow, removed 0 redundant places. [2022-12-12 13:54:15,900 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 181 transitions, 544 flow [2022-12-12 13:54:15,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 115.33333333333333) internal successors, (692), 6 states have internal predecessors, (692), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:15,905 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:15,906 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:15,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-12-12 13:54:15,906 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:15,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:15,907 INFO L85 PathProgramCache]: Analyzing trace with hash 321740019, now seen corresponding path program 1 times [2022-12-12 13:54:15,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:15,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985043926] [2022-12-12 13:54:15,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:15,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:16,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:16,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:16,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985043926] [2022-12-12 13:54:16,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985043926] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:54:16,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1160731931] [2022-12-12 13:54:16,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:16,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:54:16,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:54:16,352 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:54:16,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-12 13:54:16,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:16,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 6 conjunts are in the unsatisfiable core [2022-12-12 13:54:16,475 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:54:16,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:16,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:54:16,749 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:16,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1160731931] provided 1 perfect and 1 imperfect interpolant sequences [2022-12-12 13:54:16,749 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-12-12 13:54:16,750 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8, 5] total 9 [2022-12-12 13:54:16,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809778684] [2022-12-12 13:54:16,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:16,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:54:16,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:16,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:54:16,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-12-12 13:54:16,753 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 167 [2022-12-12 13:54:16,754 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 181 transitions, 544 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:16,754 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:16,754 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 167 [2022-12-12 13:54:16,755 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:16,939 INFO L130 PetriNetUnfolder]: 174/932 cut-off events. [2022-12-12 13:54:16,940 INFO L131 PetriNetUnfolder]: For 350/358 co-relation queries the response was YES. [2022-12-12 13:54:16,942 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1598 conditions, 932 events. 174/932 cut-off events. For 350/358 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 5758 event pairs, 37 based on Foata normal form. 0/831 useless extension candidates. Maximal degree in co-relation 1031. Up to 140 conditions per place. [2022-12-12 13:54:16,949 INFO L137 encePairwiseOnDemand]: 162/167 looper letters, 29 selfloop transitions, 5 changer transitions 11/193 dead transitions. [2022-12-12 13:54:16,949 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 158 places, 193 transitions, 658 flow [2022-12-12 13:54:16,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:54:16,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:54:16,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2022-12-12 13:54:16,951 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8607784431137725 [2022-12-12 13:54:16,952 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 9 predicate places. [2022-12-12 13:54:16,953 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 158 places, 193 transitions, 658 flow [2022-12-12 13:54:16,957 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 193 transitions, 650 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 13:54:16,957 INFO L495 AbstractCegarLoop]: Abstraction has has 158 places, 193 transitions, 650 flow [2022-12-12 13:54:16,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:16,958 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:16,958 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:16,969 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-12 13:54:17,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:54:17,170 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:17,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:17,171 INFO L85 PathProgramCache]: Analyzing trace with hash -220366417, now seen corresponding path program 2 times [2022-12-12 13:54:17,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:17,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815233460] [2022-12-12 13:54:17,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:17,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:17,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:17,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:17,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:17,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815233460] [2022-12-12 13:54:17,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815233460] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:17,323 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:17,323 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:54:17,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654039263] [2022-12-12 13:54:17,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:17,324 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:54:17,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:17,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:54:17,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:54:17,327 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 167 [2022-12-12 13:54:17,328 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 158 places, 193 transitions, 650 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:17,328 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:17,328 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 167 [2022-12-12 13:54:17,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:17,602 INFO L130 PetriNetUnfolder]: 267/1262 cut-off events. [2022-12-12 13:54:17,602 INFO L131 PetriNetUnfolder]: For 787/927 co-relation queries the response was YES. [2022-12-12 13:54:17,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2510 conditions, 1262 events. 267/1262 cut-off events. For 787/927 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 8300 event pairs, 70 based on Foata normal form. 20/1148 useless extension candidates. Maximal degree in co-relation 1329. Up to 189 conditions per place. [2022-12-12 13:54:17,612 INFO L137 encePairwiseOnDemand]: 159/167 looper letters, 67 selfloop transitions, 12 changer transitions 22/246 dead transitions. [2022-12-12 13:54:17,613 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 163 places, 246 transitions, 1067 flow [2022-12-12 13:54:17,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:54:17,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:54:17,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 863 transitions. [2022-12-12 13:54:17,615 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8612774451097804 [2022-12-12 13:54:17,617 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 14 predicate places. [2022-12-12 13:54:17,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 163 places, 246 transitions, 1067 flow [2022-12-12 13:54:17,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 163 places, 246 transitions, 1059 flow, removed 4 selfloop flow, removed 0 redundant places. [2022-12-12 13:54:17,621 INFO L495 AbstractCegarLoop]: Abstraction has has 163 places, 246 transitions, 1059 flow [2022-12-12 13:54:17,621 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:17,621 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:17,622 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:17,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-12-12 13:54:17,622 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:17,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:17,623 INFO L85 PathProgramCache]: Analyzing trace with hash 622312819, now seen corresponding path program 3 times [2022-12-12 13:54:17,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:17,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857030660] [2022-12-12 13:54:17,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:17,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:17,759 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:17,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:17,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857030660] [2022-12-12 13:54:17,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857030660] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:17,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:17,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:54:17,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301236583] [2022-12-12 13:54:17,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:17,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:54:17,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:17,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:54:17,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:54:17,762 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 167 [2022-12-12 13:54:17,763 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 163 places, 246 transitions, 1059 flow. Second operand has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:17,766 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:17,766 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 167 [2022-12-12 13:54:17,766 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:18,064 INFO L130 PetriNetUnfolder]: 304/1450 cut-off events. [2022-12-12 13:54:18,064 INFO L131 PetriNetUnfolder]: For 1445/1686 co-relation queries the response was YES. [2022-12-12 13:54:18,069 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3387 conditions, 1450 events. 304/1450 cut-off events. For 1445/1686 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 9580 event pairs, 100 based on Foata normal form. 6/1304 useless extension candidates. Maximal degree in co-relation 2389. Up to 306 conditions per place. [2022-12-12 13:54:18,075 INFO L137 encePairwiseOnDemand]: 160/167 looper letters, 95 selfloop transitions, 14 changer transitions 33/287 dead transitions. [2022-12-12 13:54:18,076 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 168 places, 287 transitions, 1599 flow [2022-12-12 13:54:18,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:54:18,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:54:18,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 840 transitions. [2022-12-12 13:54:18,078 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8383233532934131 [2022-12-12 13:54:18,080 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 19 predicate places. [2022-12-12 13:54:18,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 168 places, 287 transitions, 1599 flow [2022-12-12 13:54:18,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 167 places, 287 transitions, 1563 flow, removed 17 selfloop flow, removed 1 redundant places. [2022-12-12 13:54:18,085 INFO L495 AbstractCegarLoop]: Abstraction has has 167 places, 287 transitions, 1563 flow [2022-12-12 13:54:18,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 135.8) internal successors, (679), 5 states have internal predecessors, (679), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:18,086 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:18,086 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:18,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-12-12 13:54:18,087 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:18,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:18,087 INFO L85 PathProgramCache]: Analyzing trace with hash -441148711, now seen corresponding path program 4 times [2022-12-12 13:54:18,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:18,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703062635] [2022-12-12 13:54:18,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:18,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:18,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:18,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:18,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:18,246 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703062635] [2022-12-12 13:54:18,246 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703062635] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:18,246 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:18,246 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:54:18,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556733527] [2022-12-12 13:54:18,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:18,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:54:18,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:18,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:54:18,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:54:18,248 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 167 [2022-12-12 13:54:18,249 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 167 places, 287 transitions, 1563 flow. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:18,249 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:18,249 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 167 [2022-12-12 13:54:18,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:18,468 INFO L130 PetriNetUnfolder]: 305/1442 cut-off events. [2022-12-12 13:54:18,469 INFO L131 PetriNetUnfolder]: For 2328/2725 co-relation queries the response was YES. [2022-12-12 13:54:18,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3688 conditions, 1442 events. 305/1442 cut-off events. For 2328/2725 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 9458 event pairs, 93 based on Foata normal form. 10/1305 useless extension candidates. Maximal degree in co-relation 2575. Up to 303 conditions per place. [2022-12-12 13:54:18,480 INFO L137 encePairwiseOnDemand]: 162/167 looper letters, 72 selfloop transitions, 17 changer transitions 33/279 dead transitions. [2022-12-12 13:54:18,480 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 170 places, 279 transitions, 1728 flow [2022-12-12 13:54:18,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:54:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:54:18,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 575 transitions. [2022-12-12 13:54:18,482 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8607784431137725 [2022-12-12 13:54:18,485 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 21 predicate places. [2022-12-12 13:54:18,485 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 170 places, 279 transitions, 1728 flow [2022-12-12 13:54:18,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 170 places, 279 transitions, 1682 flow, removed 23 selfloop flow, removed 0 redundant places. [2022-12-12 13:54:18,491 INFO L495 AbstractCegarLoop]: Abstraction has has 170 places, 279 transitions, 1682 flow [2022-12-12 13:54:18,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 4 states have internal predecessors, (555), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:18,492 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:18,492 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:18,492 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-12-12 13:54:18,492 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:18,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:18,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1712854898, now seen corresponding path program 1 times [2022-12-12 13:54:18,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:18,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148049030] [2022-12-12 13:54:18,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:18,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:18,633 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:18,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:18,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148049030] [2022-12-12 13:54:18,633 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148049030] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:18,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:18,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-12-12 13:54:18,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167813165] [2022-12-12 13:54:18,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:18,634 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-12-12 13:54:18,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:18,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-12-12 13:54:18,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-12-12 13:54:18,636 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 140 out of 167 [2022-12-12 13:54:18,636 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 170 places, 279 transitions, 1682 flow. Second operand has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:18,637 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:18,637 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 140 of 167 [2022-12-12 13:54:18,637 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:18,942 INFO L130 PetriNetUnfolder]: 373/1819 cut-off events. [2022-12-12 13:54:18,942 INFO L131 PetriNetUnfolder]: For 3133/3539 co-relation queries the response was YES. [2022-12-12 13:54:18,949 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4882 conditions, 1819 events. 373/1819 cut-off events. For 3133/3539 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 13171 event pairs, 97 based on Foata normal form. 8/1651 useless extension candidates. Maximal degree in co-relation 1911. Up to 382 conditions per place. [2022-12-12 13:54:18,958 INFO L137 encePairwiseOnDemand]: 162/167 looper letters, 70 selfloop transitions, 10 changer transitions 33/290 dead transitions. [2022-12-12 13:54:18,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 173 places, 290 transitions, 1972 flow [2022-12-12 13:54:18,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-12-12 13:54:18,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2022-12-12 13:54:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 588 transitions. [2022-12-12 13:54:18,960 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8802395209580839 [2022-12-12 13:54:18,961 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 24 predicate places. [2022-12-12 13:54:18,961 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 173 places, 290 transitions, 1972 flow [2022-12-12 13:54:18,968 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 172 places, 290 transitions, 1834 flow, removed 64 selfloop flow, removed 1 redundant places. [2022-12-12 13:54:18,968 INFO L495 AbstractCegarLoop]: Abstraction has has 172 places, 290 transitions, 1834 flow [2022-12-12 13:54:18,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 142.75) internal successors, (571), 4 states have internal predecessors, (571), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:18,969 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:18,969 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:18,969 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-12-12 13:54:18,969 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:18,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1111466142, now seen corresponding path program 2 times [2022-12-12 13:54:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:18,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800768289] [2022-12-12 13:54:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:18,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:18,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:19,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:19,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800768289] [2022-12-12 13:54:19,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800768289] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:19,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:19,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-12 13:54:19,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392657292] [2022-12-12 13:54:19,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:19,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-12 13:54:19,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:19,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-12 13:54:19,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-12-12 13:54:19,140 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 167 [2022-12-12 13:54:19,141 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 172 places, 290 transitions, 1834 flow. Second operand has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:19,141 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:19,141 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 167 [2022-12-12 13:54:19,141 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:19,445 INFO L130 PetriNetUnfolder]: 366/1788 cut-off events. [2022-12-12 13:54:19,445 INFO L131 PetriNetUnfolder]: For 3278/3742 co-relation queries the response was YES. [2022-12-12 13:54:19,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5005 conditions, 1788 events. 366/1788 cut-off events. For 3278/3742 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 12823 event pairs, 99 based on Foata normal form. 20/1637 useless extension candidates. Maximal degree in co-relation 3864. Up to 380 conditions per place. [2022-12-12 13:54:19,461 INFO L137 encePairwiseOnDemand]: 160/167 looper letters, 93 selfloop transitions, 16 changer transitions 33/287 dead transitions. [2022-12-12 13:54:19,461 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 176 places, 287 transitions, 2047 flow [2022-12-12 13:54:19,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-12 13:54:19,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2022-12-12 13:54:19,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 717 transitions. [2022-12-12 13:54:19,463 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.858682634730539 [2022-12-12 13:54:19,464 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 27 predicate places. [2022-12-12 13:54:19,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 176 places, 287 transitions, 2047 flow [2022-12-12 13:54:19,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 287 transitions, 1769 flow, removed 127 selfloop flow, removed 2 redundant places. [2022-12-12 13:54:19,473 INFO L495 AbstractCegarLoop]: Abstraction has has 174 places, 287 transitions, 1769 flow [2022-12-12 13:54:19,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 136.6) internal successors, (683), 5 states have internal predecessors, (683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:19,473 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:19,473 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:19,473 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-12-12 13:54:19,474 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1024838180, now seen corresponding path program 3 times [2022-12-12 13:54:19,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:19,474 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278332143] [2022-12-12 13:54:19,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:19,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:19,688 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:19,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:19,688 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278332143] [2022-12-12 13:54:19,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278332143] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-12 13:54:19,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-12 13:54:19,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-12-12 13:54:19,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020404915] [2022-12-12 13:54:19,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-12 13:54:19,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-12-12 13:54:19,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:19,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-12-12 13:54:19,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-12-12 13:54:19,691 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 133 out of 167 [2022-12-12 13:54:19,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 174 places, 287 transitions, 1769 flow. Second operand has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:19,693 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:19,693 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 133 of 167 [2022-12-12 13:54:19,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:19,969 INFO L130 PetriNetUnfolder]: 344/1697 cut-off events. [2022-12-12 13:54:19,969 INFO L131 PetriNetUnfolder]: For 2462/2787 co-relation queries the response was YES. [2022-12-12 13:54:19,974 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4657 conditions, 1697 events. 344/1697 cut-off events. For 2462/2787 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 11573 event pairs, 89 based on Foata normal form. 26/1570 useless extension candidates. Maximal degree in co-relation 2001. Up to 354 conditions per place. [2022-12-12 13:54:19,982 INFO L137 encePairwiseOnDemand]: 160/167 looper letters, 82 selfloop transitions, 22 changer transitions 32/277 dead transitions. [2022-12-12 13:54:19,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 178 places, 277 transitions, 1922 flow [2022-12-12 13:54:19,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-12-12 13:54:19,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2022-12-12 13:54:19,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 859 transitions. [2022-12-12 13:54:19,985 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.8572854291417166 [2022-12-12 13:54:19,986 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 29 predicate places. [2022-12-12 13:54:19,986 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 178 places, 277 transitions, 1922 flow [2022-12-12 13:54:19,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 177 places, 277 transitions, 1695 flow, removed 108 selfloop flow, removed 1 redundant places. [2022-12-12 13:54:19,994 INFO L495 AbstractCegarLoop]: Abstraction has has 177 places, 277 transitions, 1695 flow [2022-12-12 13:54:19,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 136.0) internal successors, (816), 6 states have internal predecessors, (816), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:19,994 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:19,995 INFO L214 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:19,995 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-12-12 13:54:19,995 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:19,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:19,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1471364622, now seen corresponding path program 1 times [2022-12-12 13:54:19,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:19,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693833583] [2022-12-12 13:54:20,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:20,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:20,464 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:20,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:20,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693833583] [2022-12-12 13:54:20,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693833583] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:54:20,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011842924] [2022-12-12 13:54:20,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:20,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:54:20,465 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:54:20,496 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:54:20,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-12 13:54:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:20,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 39 conjunts are in the unsatisfiable core [2022-12-12 13:54:20,634 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:54:21,515 INFO L173 IndexEqualityManager]: detected equality via solver [2022-12-12 13:54:21,518 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:54:21,519 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-12-12 13:54:21,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:54:21,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:54:22,092 INFO L321 Elim1Store]: treesize reduction 5, result has 58.3 percent of original size [2022-12-12 13:54:22,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 11 [2022-12-12 13:54:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:54:22,853 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1011842924] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:54:22,853 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:54:22,853 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 23, 18] total 41 [2022-12-12 13:54:22,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714804044] [2022-12-12 13:54:22,854 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:54:22,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-12-12 13:54:22,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:54:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-12-12 13:54:22,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=1485, Unknown=0, NotChecked=0, Total=1640 [2022-12-12 13:54:22,858 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 167 [2022-12-12 13:54:22,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 177 places, 277 transitions, 1695 flow. Second operand has 41 states, 41 states have (on average 64.7560975609756) internal successors, (2655), 41 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:22,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:54:22,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 167 [2022-12-12 13:54:22,862 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:54:40,438 INFO L130 PetriNetUnfolder]: 9731/20495 cut-off events. [2022-12-12 13:54:40,439 INFO L131 PetriNetUnfolder]: For 29030/29387 co-relation queries the response was YES. [2022-12-12 13:54:40,499 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60601 conditions, 20495 events. 9731/20495 cut-off events. For 29030/29387 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 176792 event pairs, 569 based on Foata normal form. 91/19120 useless extension candidates. Maximal degree in co-relation 12954. Up to 3990 conditions per place. [2022-12-12 13:54:40,585 INFO L137 encePairwiseOnDemand]: 106/167 looper letters, 767 selfloop transitions, 306 changer transitions 659/1805 dead transitions. [2022-12-12 13:54:40,585 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 363 places, 1805 transitions, 12440 flow [2022-12-12 13:54:40,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2022-12-12 13:54:40,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2022-12-12 13:54:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 12526 transitions. [2022-12-12 13:54:40,612 INFO L526 CegarLoopForPetriNet]: DFA transition density 0.40110154023503797 [2022-12-12 13:54:40,613 INFO L295 CegarLoopForPetriNet]: 149 programPoint places, 214 predicate places. [2022-12-12 13:54:40,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 363 places, 1805 transitions, 12440 flow [2022-12-12 13:54:40,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 347 places, 1805 transitions, 10155 flow, removed 1104 selfloop flow, removed 16 redundant places. [2022-12-12 13:54:40,747 INFO L495 AbstractCegarLoop]: Abstraction has has 347 places, 1805 transitions, 10155 flow [2022-12-12 13:54:40,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 64.7560975609756) internal successors, (2655), 41 states have internal predecessors, (2655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:54:40,750 INFO L206 CegarLoopForPetriNet]: Found error trace [2022-12-12 13:54:40,751 INFO L214 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-12 13:54:40,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-12-12 13:54:40,956 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,SelfDestructingSolverStorable9 [2022-12-12 13:54:40,957 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-12-12 13:54:40,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-12 13:54:40,957 INFO L85 PathProgramCache]: Analyzing trace with hash 2015457844, now seen corresponding path program 2 times [2022-12-12 13:54:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-12 13:54:40,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994918699] [2022-12-12 13:54:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-12 13:54:40,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-12 13:54:41,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-12 13:54:52,056 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-12-12 13:54:52,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-12 13:54:52,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994918699] [2022-12-12 13:54:52,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994918699] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-12 13:54:52,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1867855098] [2022-12-12 13:54:52,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-12 13:54:52,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-12 13:54:52,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-12-12 13:54:52,060 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-12 13:54:52,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-12 13:54:52,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-12 13:54:52,196 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-12 13:54:52,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 62 conjunts are in the unsatisfiable core [2022-12-12 13:54:52,211 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-12 13:54:53,616 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-12-12 13:54:54,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 13:54:54,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-12-12 13:54:56,975 INFO L321 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-12-12 13:54:56,976 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 23 [2022-12-12 13:54:57,446 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:54:57,446 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-12 13:54:59,792 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) c_~f~0.offset)))) (or (< .cse0 0) (<= c_~size~0 .cse0) (= (select .cse1 (+ c_~f~0.offset (* 4 (select .cse1 (+ (* c_~x1~0 4) c_~f~0.offset))))) (select .cse1 (+ c_~f~0.offset (* (select .cse1 (+ c_~f~0.offset (* .cse0 4))) 4)))))))) is different from false [2022-12-12 13:55:00,034 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse1 (+ (* c_~x2~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (<= c_~size~0 .cse0) (< .cse0 0) (= (select .cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* (select .cse1 (+ (* .cse0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4))) (select .cse1 (+ |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset| (* (select .cse1 (+ (* c_~x1~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) 4)))))))) is different from false [2022-12-12 13:55:00,706 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:55:00,707 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 192 treesize of output 120 [2022-12-12 13:55:00,764 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:55:00,765 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 306 treesize of output 382 [2022-12-12 13:55:00,837 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:55:00,837 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 313 treesize of output 355 [2022-12-12 13:55:00,938 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-12-12 13:55:00,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 124 treesize of output 229 [2022-12-12 13:55:04,343 INFO L208 tifierPushTermWalker]: Run 10 iterations without descend maybe there is a nontermination bug. [2022-12-12 13:55:05,195 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-12 13:55:05,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1867855098] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-12 13:55:05,196 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-12 13:55:05,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 32, 30] total 75 [2022-12-12 13:55:05,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559191088] [2022-12-12 13:55:05,196 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-12 13:55:05,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-12-12 13:55:05,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-12 13:55:05,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-12-12 13:55:05,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=4862, Unknown=26, NotChecked=286, Total=5550 [2022-12-12 13:55:05,201 INFO L481 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 167 [2022-12-12 13:55:05,204 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 347 places, 1805 transitions, 10155 flow. Second operand has 75 states, 75 states have (on average 44.24) internal successors, (3318), 75 states have internal predecessors, (3318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-12-12 13:55:05,205 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-12-12 13:55:05,205 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 167 [2022-12-12 13:55:05,205 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-12-12 13:55:16,064 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~x2~0 4))) (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse15 (+ .cse7 c_~f~0.offset)) (.cse5 (* c_~x1~0 4))) (let ((.cse13 (+ .cse5 c_~f~0.offset)) (.cse0 (select .cse1 .cse15))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset))) (.cse9 (let ((.cse16 (< c_~size~0 1))) (and (or (< c_~x1~0 1) .cse16) (or (< c_~size~0 (+ c_~x1~0 2)) .cse16)))) (.cse3 (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse13) 4))))) (and (or (< .cse0 0) (<= c_~size~0 .cse0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) .cse3)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (let ((.cse6 (select .cse4 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) (or (= (select .cse4 (+ (* (select .cse4 (+ .cse5 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret11#1.offset| (* (select .cse4 (+ (* .cse6 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4)))) (<= c_~size~0 .cse6) (< .cse6 0))))) (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (let ((.cse8 (* 3 c_~n~0))) (<= (+ (* (div .cse8 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse8 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse2) (< c_~x2~0 0)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse10 0) (= (select .cse11 (+ (* (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ (* (select .cse11 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse10))))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) (= c_~x1~0 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse14 (select .cse12 .cse15))) (or (= (select .cse12 (+ (* (select .cse12 .cse13) 4) c_~f~0.offset)) (select .cse12 (+ (* (select .cse12 (+ c_~f~0.offset (* .cse14 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse14) (< .cse14 0))))) (or (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|) (= .cse3 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0))))))) is different from false [2022-12-12 13:55:17,064 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~x2~0 4))) (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse15 (+ .cse7 c_~f~0.offset)) (.cse5 (* c_~x1~0 4))) (let ((.cse13 (+ .cse5 c_~f~0.offset)) (.cse0 (select .cse1 .cse15))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset))) (.cse9 (let ((.cse16 (< c_~size~0 1))) (and (or (< c_~x1~0 1) .cse16) (or (< c_~size~0 (+ c_~x1~0 2)) .cse16)))) (.cse3 (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse13) 4))))) (and (or (< .cse0 0) (<= c_~size~0 .cse0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) .cse3)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (let ((.cse6 (select .cse4 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) (or (= (select .cse4 (+ (* (select .cse4 (+ .cse5 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret11#1.offset| (* (select .cse4 (+ (* .cse6 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4)))) (<= c_~size~0 .cse6) (< .cse6 0))))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (let ((.cse8 (* 3 c_~n~0))) (<= (+ (* (div .cse8 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse8 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse2) (< c_~x2~0 0)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse10 0) (= (select .cse11 (+ (* (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ (* (select .cse11 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse10))))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) (= c_~x1~0 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse14 (select .cse12 .cse15))) (or (= (select .cse12 (+ (* (select .cse12 .cse13) 4) c_~f~0.offset)) (select .cse12 (+ (* (select .cse12 (+ c_~f~0.offset (* .cse14 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse14) (< .cse14 0))))) (or (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|) (= .cse3 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0))))))) is different from false [2022-12-12 13:55:22,710 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~x2~0 4))) (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse15 (+ .cse7 c_~f~0.offset)) (.cse5 (* c_~x1~0 4))) (let ((.cse13 (+ .cse5 c_~f~0.offset)) (.cse0 (select .cse1 .cse15))) (let ((.cse2 (select .cse1 (+ (* .cse0 4) c_~f~0.offset))) (.cse9 (let ((.cse16 (< c_~size~0 1))) (and (or (< c_~x1~0 1) .cse16) (or (< c_~size~0 (+ c_~x1~0 2)) .cse16)))) (.cse3 (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse13) 4))))) (and (or (< .cse0 0) (<= c_~size~0 .cse0) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse2))) .cse3)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse4 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (let ((.cse6 (select .cse4 (+ .cse7 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) (or (= (select .cse4 (+ (* (select .cse4 (+ .cse5 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (select .cse4 (+ |c_ULTIMATE.start_main_#t~ret11#1.offset| (* (select .cse4 (+ (* .cse6 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4)))) (<= c_~size~0 .cse6) (< .cse6 0))))) (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (let ((.cse8 (* 3 c_~n~0))) (<= (+ (* (div .cse8 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse8 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse9 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse2) (< c_~x2~0 0)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse11 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 (+ .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse10 0) (= (select .cse11 (+ (* (select .cse11 (+ (* .cse10 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse11 (+ (* (select .cse11 (+ .cse5 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse10))))) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse9) (= c_~x1~0 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse12 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse14 (select .cse12 .cse15))) (or (= (select .cse12 (+ (* (select .cse12 .cse13) 4) c_~f~0.offset)) (select .cse12 (+ (* (select .cse12 (+ c_~f~0.offset (* .cse14 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse14) (< .cse14 0))))) (or (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|) (= .cse3 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0))))))) is different from false [2022-12-12 13:55:25,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:55:36,212 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~x2~0 4))) (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse18 (+ .cse10 c_~f~0.offset)) (.cse8 (* c_~x1~0 4))) (let ((.cse16 (+ .cse8 c_~f~0.offset)) (.cse4 (select .cse1 .cse18))) (let ((.cse5 (select .cse1 (+ (* .cse4 4) c_~f~0.offset))) (.cse12 (let ((.cse19 (< c_~size~0 1))) (and (or (< c_~x1~0 1) .cse19) (or (< c_~size~0 (+ c_~x1~0 2)) .cse19)))) (.cse2 (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|)) (.cse6 (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse16) 4)))) (.cse0 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) (.cse3 (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0))) (and (or (= .cse0 (select .cse1 (+ c_~f~0.offset (* 4 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))) .cse2 .cse3) (or (< .cse4 0) (<= c_~size~0 .cse4) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse5))) .cse6)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (let ((.cse9 (select .cse7 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) (or (= (select .cse7 (+ (* (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret11#1.offset| (* (select .cse7 (+ (* .cse9 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4)))) (<= c_~size~0 .cse9) (< .cse9 0))))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (let ((.cse11 (* 3 c_~n~0))) (<= (+ (* (div .cse11 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse11 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (or .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse5) (< c_~x2~0 0)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse14 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse13 0) (= (select .cse14 (+ (* (select .cse14 (+ (* .cse13 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse14 (+ (* (select .cse14 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse13))))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12) (= c_~x1~0 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse17 (select .cse15 .cse18))) (or (= (select .cse15 (+ (* (select .cse15 .cse16) 4) c_~f~0.offset)) (select .cse15 (+ (* (select .cse15 (+ c_~f~0.offset (* .cse17 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse17) (< .cse17 0))))) (or .cse2 (= .cse6 .cse0) .cse3)))))) is different from false [2022-12-12 13:55:37,117 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* c_~x2~0 4))) (let ((.cse1 (select |c_#memory_int| c_~f~0.base)) (.cse18 (+ .cse10 c_~f~0.offset)) (.cse8 (* c_~x1~0 4))) (let ((.cse16 (+ .cse8 c_~f~0.offset)) (.cse4 (select .cse1 .cse18))) (let ((.cse5 (select .cse1 (+ (* .cse4 4) c_~f~0.offset))) (.cse12 (let ((.cse19 (< c_~size~0 1))) (and (or (< c_~x1~0 1) .cse19) (or (< c_~size~0 (+ c_~x1~0 2)) .cse19)))) (.cse2 (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|)) (.cse6 (select .cse1 (+ c_~f~0.offset (* (select .cse1 .cse16) 4)))) (.cse0 (select .cse1 (+ (* (select .cse1 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) (.cse3 (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0))) (and (or (= .cse0 (select .cse1 (+ c_~f~0.offset (* 4 |c_thread1Thread1of1ForFork0_#t~mem1#1|)))) .cse2 .cse3) (or (< .cse4 0) (<= c_~size~0 .cse4) (= (select .cse1 (+ c_~f~0.offset (* 4 .cse5))) .cse6)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_main_#t~ret11#1.base|))) (let ((.cse9 (select .cse7 (+ .cse10 |c_ULTIMATE.start_main_#t~ret11#1.offset|)))) (or (= (select .cse7 (+ (* (select .cse7 (+ .cse8 |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) (select .cse7 (+ |c_ULTIMATE.start_main_#t~ret11#1.offset| (* (select .cse7 (+ (* .cse9 4) |c_ULTIMATE.start_main_#t~ret11#1.offset|)) 4)))) (<= c_~size~0 .cse9) (< .cse9 0))))) (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (let ((.cse11 (* 3 c_~n~0))) (<= (+ (* (div .cse11 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse11 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (or .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_#in~size#1|)) (or .cse12 (< 1 |c_ULTIMATE.start_create_fresh_int_array_~size#1|)) (or (<= c_~size~0 c_~x2~0) (= c_~x1~0 .cse5) (< c_~x2~0 0)) (forall ((v_ArrVal_170 (Array Int Int)) (v_ArrVal_169 (Array Int Int))) (let ((.cse14 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_169) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse14 (+ .cse10 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< .cse13 0) (= (select .cse14 (+ (* (select .cse14 (+ (* .cse13 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (select .cse14 (+ (* (select .cse14 (+ .cse8 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (<= c_~size~0 .cse13))))) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (or (< (+ |c_ULTIMATE.start_create_fresh_int_array_~i~2#1| 1) |c_ULTIMATE.start_create_fresh_int_array_~size#1|) .cse12) (= c_~x1~0 0) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse17 (select .cse15 .cse18))) (or (= (select .cse15 (+ (* (select .cse15 .cse16) 4) c_~f~0.offset)) (select .cse15 (+ (* (select .cse15 (+ c_~f~0.offset (* .cse17 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse17) (< .cse17 0))))) (or .cse2 (= .cse6 .cse0) .cse3)))))) is different from false [2022-12-12 13:55:37,223 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| c_~f~0.base))) (let ((.cse0 (select .cse2 c_~f~0.offset)) (.cse3 (+ (* c_~x2~0 4) c_~f~0.offset))) (and (<= c_~n~0 (+ (* 4294967296 (div c_~n~0 4294967296)) 1431655764)) (= c_~x1~0 .cse0) (<= c_~size~0 1) (let ((.cse1 (* 3 c_~n~0))) (<= (+ (* (div .cse1 4294967296) 4294967296) |c_thread1Thread1of1ForFork0_~i~0#1| 1) (+ .cse1 (* (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296) 4294967296)))) (= |c_thread2Thread1of1ForFork1_#t~mem3#1| .cse0) (= |c_thread1Thread1of1ForFork0_~i~0#1| 0) (= c_~x1~0 (select .cse2 .cse3)) (forall ((v_ArrVal_170 (Array Int Int))) (let ((.cse4 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_170) c_~f~0.base))) (let ((.cse5 (select .cse4 .cse3))) (or (= (select .cse4 (+ (* (select .cse4 (+ (* c_~x1~0 4) c_~f~0.offset)) 4) c_~f~0.offset)) (select .cse4 (+ (* (select .cse4 (+ c_~f~0.offset (* .cse5 4))) 4) c_~f~0.offset))) (<= c_~size~0 .cse5) (< .cse5 0)))))))) is different from false [2022-12-12 13:55:39,435 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] [2022-12-12 13:55:43,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:55:56,173 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] [2022-12-12 13:56:05,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:56:09,910 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:56:18,194 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:56:23,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:56:29,398 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:56: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 [] [2022-12-12 13:56:56,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 13:56:58,610 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (* 3 c_~n~0))) (let ((.cse2 (div .cse5 4294967296)) (.cse0 (div c_~n~0 4294967296))) (let ((.cse1 (* 8589934592 .cse0)) (.cse4 (* .cse2 4294967296)) (.cse3 (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (and (<= c_~n~0 (+ 715827881 (* 4294967296 .cse0) (* 715827883 |c_thread1Thread1of1ForFork0_~i~0#1|))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ .cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 1431655765)) (+ (* 2 c_~n~0) 1431655765)) (or (<= (+ .cse1 (* 4294967296 |c_thread1Thread1of1ForFork0_#t~post2#1|) 1431655763 |c_thread2Thread1of1ForFork1_~i~1#1| (* 12297829383904690176 .cse2) (* 12297829383904690176 .cse3)) (+ (* 8589934595 c_~n~0) (* 12297829383904690176 (div (+ (- 1) |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)))) (<= (+ .cse4 |c_thread2Thread1of1ForFork1_~i~1#1| 4294967294) (+ (* .cse3 4294967296) .cse5))) (<= .cse4 (+ .cse1 c_~n~0 1431655761 (* 1431655765 |c_thread1Thread1of1ForFork0_#t~post2#1|))) (<= (+ .cse4 (* (div (* (- 3) c_~n~0) 4294967296) 4294967296) 4294967295 |c_thread1Thread1of1ForFork0_~i~0#1|) (* (div (+ (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (not (<= (+ .cse3 1) 0)))))) is different from false [2022-12-12 13:57:05,830 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:09,235 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:11,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:33,636 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:46,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:57:53,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:58:06,805 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:58:56,803 WARN L233 SmtUtils]: Spent 25.05s on a formula simplification. DAG size of input: 104 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:59:02,045 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:59:08,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2022-12-12 13:59:50,723 WARN L233 SmtUtils]: Spent 11.89s on a formula simplification. DAG size of input: 92 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 13:59:54,440 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 13:59:56,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:03,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:10,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:25,717 WARN L233 SmtUtils]: Spent 5.03s on a formula simplification. DAG size of input: 92 DAG size of output: 86 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:00:28,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:30,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:32,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:35,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:00:39,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:01:10,280 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:01:11,531 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:02:08,605 WARN L233 SmtUtils]: Spent 10.46s on a formula simplification. DAG size of input: 111 DAG size of output: 89 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:02:26,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:02:36,678 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse7 (* 3 c_~n~0))) (let ((.cse10 (select |c_#memory_int| c_~f~0.base)) (.cse3 (div .cse7 4294967296)) (.cse0 (div c_~n~0 4294967296))) (let ((.cse1 (* 8589934592 .cse0)) (.cse6 (* .cse3 4294967296)) (.cse5 (div (+ (- 1) |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (.cse2 (* 2 c_~n~0)) (.cse8 (* 1431655765 |c_thread1Thread1of1ForFork0_#t~post2#1|)) (.cse9 (select .cse10 c_~f~0.offset)) (.cse4 (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (and (<= c_~n~0 (+ 715827881 (* 4294967296 .cse0) (* 715827883 |c_thread1Thread1of1ForFork0_~i~0#1|))) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ .cse1 (* |c_thread1Thread1of1ForFork0_~i~0#1| 1431655765)) (+ .cse2 1431655765)) (<= c_~size~0 1) (or (<= (+ .cse1 (* 4294967296 |c_thread1Thread1of1ForFork0_#t~post2#1|) 1431655763 |c_thread2Thread1of1ForFork1_~i~1#1| (* 12297829383904690176 .cse3) (* 12297829383904690176 .cse4)) (+ (* 8589934595 c_~n~0) (* 12297829383904690176 .cse5))) (<= (+ .cse6 |c_thread2Thread1of1ForFork1_~i~1#1| 4294967294) (+ (* .cse4 4294967296) .cse7))) (<= .cse6 (+ .cse1 c_~n~0 1431655761 .cse8)) (<= (+ .cse6 (* (div (* (- 3) c_~n~0) 4294967296) 4294967296) 4294967295 |c_thread1Thread1of1ForFork0_~i~0#1|) (* (div (+ (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (= |c_thread2Thread1of1ForFork1_#t~mem3#1| .cse9) (<= (+ (* 2863311531 .cse3) |c_thread1Thread1of1ForFork0_#t~post2#1| 1) (+ (* 2863311531 .cse5) .cse2 (div (+ c_~n~0 1431655761 .cse8) 4294967296))) (= c_~x1~0 (select .cse10 (+ c_~f~0.offset (* .cse9 4)))) (not (<= (+ .cse4 1) 0)))))) is different from false [2022-12-12 14:03:33,471 WARN L233 SmtUtils]: Spent 16.11s on a formula simplification. DAG size of input: 92 DAG size of output: 83 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:03:35,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:03:52,495 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:03:57,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:04:15,116 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:04:59,554 WARN L233 SmtUtils]: Spent 11.25s on a formula simplification. DAG size of input: 104 DAG size of output: 95 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:05:49,386 WARN L233 SmtUtils]: Spent 11.79s on a formula simplification. DAG size of input: 90 DAG size of output: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:05:50,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:06:04,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:06:59,828 WARN L233 SmtUtils]: Spent 22.74s on a formula simplification. DAG size of input: 91 DAG size of output: 68 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-12 14:07:17,688 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (* 3 c_~n~0))) (let ((.cse0 (div c_~n~0 4294967296)) (.cse14 (div .cse10 4294967296)) (.cse1 (div |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296))) (let ((.cse11 (* .cse1 4294967296)) (.cse3 (* |c_thread1Thread1of1ForFork0_~i~0#1| 1431655765)) (.cse9 (* .cse14 4294967296)) (.cse12 (* (div (+ (- 1) |c_thread1Thread1of1ForFork0_~i~0#1|) 4294967296) 4294967296)) (.cse8 (div (+ (- 1) |c_thread1Thread1of1ForFork0_#t~post2#1|) 4294967296)) (.cse4 (* 2 c_~n~0)) (.cse13 (* 1431655765 |c_thread1Thread1of1ForFork0_#t~post2#1|)) (.cse2 (* 8589934592 .cse0)) (.cse5 (* 12297829383904690176 .cse14)) (.cse7 (* 8589934595 c_~n~0)) (.cse6 (div |c_thread2Thread1of1ForFork1_~i~1#1| 4294967296))) (and (<= c_~n~0 (+ 715827881 (* 4294967296 .cse0) (* 715827883 |c_thread1Thread1of1ForFork0_~i~0#1|))) (<= .cse1 0) (= |c_thread2Thread1of1ForFork1_~i~1#1| 0) (<= (+ .cse2 .cse3) (+ .cse4 1431655765)) (or (<= (+ .cse2 (* 4294967296 |c_thread1Thread1of1ForFork0_#t~post2#1|) 1431655763 |c_thread2Thread1of1ForFork1_~i~1#1| .cse5 (* 12297829383904690176 .cse6)) (+ .cse7 (* 12297829383904690176 .cse8))) (<= (+ .cse9 |c_thread2Thread1of1ForFork1_~i~1#1| 4294967294) (+ (* .cse6 4294967296) .cse10))) (<= (+ .cse9 .cse11 1) (+ .cse12 .cse10)) (<= .cse9 (+ .cse2 c_~n~0 .cse11 .cse3 1431655761)) (<= .cse9 (+ .cse2 c_~n~0 1431655761 .cse13)) (<= (+ .cse9 (* (div (* (- 3) c_~n~0) 4294967296) 4294967296) 4294967295 |c_thread1Thread1of1ForFork0_~i~0#1|) .cse12) (<= (+ (* 2863311531 .cse14) |c_thread1Thread1of1ForFork0_#t~post2#1| 1) (+ (* 2863311531 .cse8) .cse4 (div (+ c_~n~0 1431655761 .cse13) 4294967296))) (<= (+ .cse2 1431655766 .cse5 (* |c_thread1Thread1of1ForFork0_~i~0#1| 4294967296)) (+ .cse7 (* .cse1 12297829383904690176))) (not (<= (+ .cse6 1) 0)) (or (<= c_~size~0 |c_thread2Thread1of1ForFork1_#t~mem3#1|) (< |c_thread2Thread1of1ForFork1_#t~mem3#1| 0) (= (let ((.cse15 (select |c_#memory_int| c_~f~0.base))) (select .cse15 (+ (* (select .cse15 (+ c_~f~0.offset (* |c_thread2Thread1of1ForFork1_#t~mem3#1| 4))) 4) c_~f~0.offset))) c_~x1~0)) (= |c_thread2Thread1of1ForFork1_#t~post4#1| 0))))) is different from false [2022-12-12 14:07:19,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-12-12 14:07:55,892 WARN L233 SmtUtils]: Spent 13.52s on a formula simplification. DAG size of input: 120 DAG size of output: 97 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) Received shutdown request... [2022-12-12 14:08:25,438 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 14:08:25,438 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2022-12-12 14:08:26,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-12-12 14:08:26,643 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process [2022-12-12 14:08:26,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 137 [2022-12-12 14:08:26,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 380 states. [2022-12-12 14:08:26,653 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-12-12 14:08:26,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-12-12 14:08:26,653 WARN L619 AbstractCegarLoop]: Verification canceled: while executing Executor. [2022-12-12 14:08:26,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 3 remaining) [2022-12-12 14:08:26,655 INFO L805 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 3 remaining) [2022-12-12 14:08:26,655 INFO L445 BasicCegarLoop]: Path program histogram: [4, 3, 2, 1, 1] [2022-12-12 14:08:26,658 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2022-12-12 14:08:26,658 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-12-12 14:08:26,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.12 02:08:26 BasicIcfg [2022-12-12 14:08:26,660 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-12-12 14:08:26,661 INFO L158 Benchmark]: Toolchain (without parser) took 853471.19ms. Allocated memory was 232.8MB in the beginning and 916.5MB in the end (delta: 683.7MB). Free memory was 208.6MB in the beginning and 385.7MB in the end (delta: -177.0MB). Peak memory consumption was 508.2MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,661 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 232.8MB. Free memory was 209.2MB in the beginning and 209.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 8.0GB. [2022-12-12 14:08:26,661 INFO L158 Benchmark]: CACSL2BoogieTranslator took 258.46ms. Allocated memory is still 232.8MB. Free memory was 208.6MB in the beginning and 197.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,661 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.64ms. Allocated memory is still 232.8MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,662 INFO L158 Benchmark]: Boogie Preprocessor took 46.94ms. Allocated memory is still 232.8MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,662 INFO L158 Benchmark]: RCFGBuilder took 514.20ms. Allocated memory is still 232.8MB. Free memory was 193.4MB in the beginning and 177.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,662 INFO L158 Benchmark]: TraceAbstraction took 852588.01ms. Allocated memory was 232.8MB in the beginning and 916.5MB in the end (delta: 683.7MB). Free memory was 176.1MB in the beginning and 385.7MB in the end (delta: -209.5MB). Peak memory consumption was 475.7MB. Max. memory is 8.0GB. [2022-12-12 14:08:26,663 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.20ms. Allocated memory is still 232.8MB. Free memory was 209.2MB in the beginning and 209.1MB in the end (delta: 86.2kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 258.46ms. Allocated memory is still 232.8MB. Free memory was 208.6MB in the beginning and 197.1MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 54.64ms. Allocated memory is still 232.8MB. Free memory was 197.1MB in the beginning and 195.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.94ms. Allocated memory is still 232.8MB. Free memory was 195.0MB in the beginning and 193.4MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 514.20ms. Allocated memory is still 232.8MB. Free memory was 193.4MB in the beginning and 177.2MB in the end (delta: 16.3MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 852588.01ms. Allocated memory was 232.8MB in the beginning and 916.5MB in the end (delta: 683.7MB). Free memory was 176.1MB in the beginning and 385.7MB in the end (delta: -209.5MB). Peak memory consumption was 475.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 91]: Timeout (TraceAbstraction) Unable to prove that call to reach_error is unreachable Cancelled while executing Executor. - TimeoutResultAtElement [Line: 86]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - TimeoutResultAtElement [Line: 85]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Cancelled while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 213 locations, 3 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.2s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 852.5s, OverallIterations: 11, TraceHistogramMax: 2, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 821.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 147 mSolverCounterUnknown, 7479 SdHoareTripleChecker+Valid, 141.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7479 mSDsluCounter, 13519 SdHoareTripleChecker+Invalid, 138.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 922 IncrementalHoareTripleChecker+Unchecked, 12822 mSDsCounter, 358 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 20849 IncrementalHoareTripleChecker+Invalid, 22276 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 358 mSolverCounterUnsat, 697 mSDtfsCounter, 20849 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1407 GetRequests, 702 SyntacticMatches, 7 SemanticMatches, 697 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 85880 ImplicationChecksByTransitivity, 684.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10155occurred in iteration=10, InterpolantAutomatonStates: 239, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 10 MinimizatonAttempts, 3131 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 28.8s InterpolantComputationTime, 1623 NumberOfCodeBlocks, 1623 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1992 ConstructedInterpolants, 55 QuantifiedInterpolants, 19609 SizeOfPredicates, 68 NumberOfNonLiveVariables, 818 ConjunctsInSsa, 107 ConjunctsInUnsatCore, 17 InterpolantComputations, 9 PerfectInterpolantSequences, 20/76 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