/usr/bin/java -Xmx16000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-PN-NoLbe-After.epf -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -i ../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 14:27:19,610 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 14:27:19,612 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 14:27:19,700 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 14:27:19,701 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 14:27:19,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 14:27:19,707 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 14:27:19,710 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 14:27:19,712 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 14:27:19,717 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 14:27:19,718 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 14:27:19,719 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 14:27:19,719 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 14:27:19,720 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 14:27:19,721 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 14:27:19,721 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 14:27:19,722 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 14:27:19,722 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 14:27:19,724 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 14:27:19,725 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 14:27:19,726 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 14:27:19,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 14:27:19,733 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 14:27:19,734 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 14:27:19,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 14:27:19,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 14:27:19,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 14:27:19,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 14:27:19,745 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 14:27:19,746 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 14:27:19,746 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 14:27:19,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 14:27:19,748 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 14:27:19,748 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 14:27:19,750 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 14:27:19,750 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 14:27:19,750 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 14:27:19,751 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 14:27:19,751 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 14:27:19,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 14:27:19,752 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 14:27:19,753 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-After.epf [2022-01-19 14:27:19,785 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 14:27:19,786 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 14:27:19,787 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 14:27:19,787 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 14:27:19,787 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 14:27:19,788 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 14:27:19,788 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 14:27:19,788 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 14:27:19,788 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 14:27:19,788 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 14:27:19,789 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 14:27:19,789 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 14:27:19,789 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 14:27:19,789 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 14:27:19,789 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 14:27:19,790 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 14:27:19,790 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 14:27:19,791 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:27:19,791 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 14:27:19,791 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 14:27:19,791 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 14:27:19,792 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 14:27:19,792 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 14:27:19,793 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 14:27:19,793 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 14:27:19,793 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 14:27:19,793 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 [2022-01-19 14:27:20,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 14:27:20,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 14:27:20,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 14:27:20,033 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 14:27:20,034 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 14:27:20,035 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-19 14:27:20,087 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d482548e8/cd3aef72551c430db2b3b8243fc3c47a/FLAGa10dceda3 [2022-01-19 14:27:20,478 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 14:27:20,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c [2022-01-19 14:27:20,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d482548e8/cd3aef72551c430db2b3b8243fc3c47a/FLAGa10dceda3 [2022-01-19 14:27:20,885 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d482548e8/cd3aef72551c430db2b3b8243fc3c47a [2022-01-19 14:27:20,887 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 14:27:20,888 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 14:27:20,889 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 14:27:20,889 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 14:27:20,892 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 14:27:20,893 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:27:20" (1/1) ... [2022-01-19 14:27:20,895 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48834d25 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:20, skipping insertion in model container [2022-01-19 14:27:20,895 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:27:20" (1/1) ... [2022-01-19 14:27:20,901 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 14:27:20,922 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 14:27:21,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-01-19 14:27:21,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:27:21,207 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 14:27:21,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-max-array.wvr.c[2553,2566] [2022-01-19 14:27:21,247 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:27:21,260 INFO L208 MainTranslator]: Completed translation [2022-01-19 14:27:21,261 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21 WrapperNode [2022-01-19 14:27:21,261 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 14:27:21,262 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 14:27:21,263 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 14:27:21,263 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 14:27:21,269 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,289 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,316 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-01-19 14:27:21,316 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 14:27:21,317 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 14:27:21,317 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 14:27:21,317 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 14:27:21,324 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,344 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,348 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,349 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 14:27:21,352 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 14:27:21,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 14:27:21,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 14:27:21,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (1/1) ... [2022-01-19 14:27:21,359 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:27:21,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:21,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-19 14:27:21,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-19 14:27:21,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 14:27:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 14:27:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 14:27:21,419 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 14:27:21,419 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 14:27:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 14:27:21,420 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 14:27:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 14:27:21,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 14:27:21,422 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 14:27:21,422 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 14:27:21,423 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 14:27:21,424 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-01-19 14:27:21,546 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 14:27:21,547 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 14:27:21,766 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 14:27:21,823 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 14:27:21,823 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 14:27:21,825 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:27:21 BoogieIcfgContainer [2022-01-19 14:27:21,825 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 14:27:21,827 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 14:27:21,827 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 14:27:21,838 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 14:27:21,838 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:27:20" (1/3) ... [2022-01-19 14:27:21,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552cac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:27:21, skipping insertion in model container [2022-01-19 14:27:21,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:27:21" (2/3) ... [2022-01-19 14:27:21,839 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@552cac54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:27:21, skipping insertion in model container [2022-01-19 14:27:21,839 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:27:21" (3/3) ... [2022-01-19 14:27:21,840 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array.wvr.c [2022-01-19 14:27:21,845 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 14:27:21,845 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 14:27:21,845 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 14:27:21,923 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,924 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,924 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,924 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,925 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,926 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,926 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,927 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,927 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,928 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,928 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,928 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,929 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,929 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,929 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,930 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,930 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,930 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,931 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,931 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,931 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,931 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,932 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,933 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,933 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,934 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,952 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,952 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,953 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,953 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,953 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,954 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,954 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,954 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,954 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,955 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,955 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,955 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,956 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,957 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,957 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,958 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,958 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,958 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,959 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,960 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,962 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,962 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,963 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,964 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,964 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,965 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,966 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:27:21,971 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 14:27:22,013 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 14:27:22,019 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=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, mLoopAccelerationTechnique=FAST_UPR [2022-01-19 14:27:22,019 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 14:27:22,031 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 14:27:22,100 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-01-19 14:27:22,101 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 14:27:22,104 INFO L84 FinitePrefix]: Finished finitePrefix Result has 163 conditions, 150 events. 12/150 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 112. Up to 2 conditions per place. [2022-01-19 14:27:22,104 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 14:27:22,115 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-01-19 14:27:22,158 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-01-19 14:27:22,158 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 14:27:22,159 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:22,160 INFO L254 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] [2022-01-19 14:27:22,160 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:22,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:22,167 INFO L85 PathProgramCache]: Analyzing trace with hash -977644638, now seen corresponding path program 1 times [2022-01-19 14:27:22,174 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:22,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23263003] [2022-01-19 14:27:22,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:22,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:22,426 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:22,426 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:22,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23263003] [2022-01-19 14:27:22,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23263003] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:27:22,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:27:22,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 14:27:22,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735325944] [2022-01-19 14:27:22,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:27:22,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 14:27:22,439 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:22,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 14:27:22,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 14:27:22,473 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-01-19 14:27:22,479 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 137 places, 139 transitions, 296 flow. Second operand has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:22,479 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:22,479 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-01-19 14:27:22,480 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:22,584 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-01-19 14:27:22,584 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-01-19 14:27:22,588 INFO L84 FinitePrefix]: Finished finitePrefix Result has 355 conditions, 264 events. 41/264 cut-off events. For 50/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 695 event pairs, 15 based on Foata normal form. 42/275 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-01-19 14:27:22,591 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-01-19 14:27:22,591 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-01-19 14:27:22,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 14:27:22,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 14:27:22,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-01-19 14:27:22,604 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-01-19 14:27:22,605 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-01-19 14:27:22,605 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-01-19 14:27:22,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:22,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-01-19 14:27:22,613 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 143.5) internal successors, (287), 2 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:22,618 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:22,618 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 153.0) internal successors, (459), 3 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:22,620 INFO L186 Difference]: Start difference. First operand has 137 places, 139 transitions, 296 flow. Second operand 2 states and 287 transitions. [2022-01-19 14:27:22,621 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-01-19 14:27:22,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 131 transitions, 286 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-01-19 14:27:22,628 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-01-19 14:27:22,630 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=131, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=260, PETRI_PLACES=132, PETRI_TRANSITIONS=127} [2022-01-19 14:27:22,635 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-01-19 14:27:22,635 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-01-19 14:27:22,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 139.0) internal successors, (278), 2 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:22,635 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:22,636 INFO L254 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] [2022-01-19 14:27:22,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 14:27:22,637 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:22,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash 1446866490, now seen corresponding path program 1 times [2022-01-19 14:27:22,638 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:22,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [681591674] [2022-01-19 14:27:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:22,639 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:22,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:23,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:23,002 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:23,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [681591674] [2022-01-19 14:27:23,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [681591674] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:27:23,003 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:27:23,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:27:23,003 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060631144] [2022-01-19 14:27:23,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:27:23,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:27:23,005 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:23,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:27:23,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:27:23,007 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-01-19 14:27:23,008 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 127 transitions, 260 flow. Second operand has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:23,008 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:23,008 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-01-19 14:27:23,009 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:23,256 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-01-19 14:27:23,256 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 14:27:23,258 INFO L84 FinitePrefix]: Finished finitePrefix Result has 1137 conditions, 678 events. 295/678 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2975 event pairs, 167 based on Foata normal form. 1/510 useless extension candidates. Maximal degree in co-relation 1134. Up to 421 conditions per place. [2022-01-19 14:27:23,264 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-01-19 14:27:23,264 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-01-19 14:27:23,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 14:27:23,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 14:27:23,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-01-19 14:27:23,271 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-01-19 14:27:23,271 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-01-19 14:27:23,271 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-01-19 14:27:23,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:23,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-01-19 14:27:23,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 100.875) internal successors, (807), 8 states have internal predecessors, (807), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:23,279 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:23,280 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:23,280 INFO L186 Difference]: Start difference. First operand has 132 places, 127 transitions, 260 flow. Second operand 8 states and 807 transitions. [2022-01-19 14:27:23,280 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-01-19 14:27:23,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 135 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-01-19 14:27:23,286 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-01-19 14:27:23,286 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=288, PETRI_PLACES=139, PETRI_TRANSITIONS=128} [2022-01-19 14:27:23,287 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 14:27:23,288 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-01-19 14:27:23,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.5) internal successors, (788), 8 states have internal predecessors, (788), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:23,291 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:23,296 INFO L254 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] [2022-01-19 14:27:23,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 14:27:23,297 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:23,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:23,297 INFO L85 PathProgramCache]: Analyzing trace with hash -312552496, now seen corresponding path program 1 times [2022-01-19 14:27:23,297 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:23,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963028077] [2022-01-19 14:27:23,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:23,298 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:23,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:23,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:23,482 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:23,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963028077] [2022-01-19 14:27:23,482 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963028077] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:23,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [609318611] [2022-01-19 14:27:23,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:23,483 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:23,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:23,491 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:23,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-19 14:27:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:23,596 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 14:27:23,605 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:23,855 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:23,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:27:24,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:24,172 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [609318611] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:24,172 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:27:24,172 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 14:27:24,172 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080223394] [2022-01-19 14:27:24,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:27:24,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 14:27:24,174 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:24,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 14:27:24,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 14:27:24,177 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-01-19 14:27:24,178 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 128 transitions, 288 flow. Second operand has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:24,179 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:24,179 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-01-19 14:27:24,179 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:24,348 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-01-19 14:27:24,349 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 14:27:24,351 INFO L84 FinitePrefix]: Finished finitePrefix Result has 834 conditions, 510 events. 175/510 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2082 event pairs, 45 based on Foata normal form. 0/424 useless extension candidates. Maximal degree in co-relation 826. Up to 137 conditions per place. [2022-01-19 14:27:24,355 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-01-19 14:27:24,355 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-01-19 14:27:24,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 14:27:24,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 14:27:24,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-01-19 14:27:24,358 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-01-19 14:27:24,358 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-01-19 14:27:24,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-01-19 14:27:24,359 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:24,359 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-01-19 14:27:24,361 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 118.71428571428571) internal successors, (831), 7 states have internal predecessors, (831), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:24,363 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:24,364 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 153.0) internal successors, (1224), 8 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:24,364 INFO L186 Difference]: Start difference. First operand has 139 places, 128 transitions, 288 flow. Second operand 7 states and 831 transitions. [2022-01-19 14:27:24,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-01-19 14:27:24,367 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 368 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-01-19 14:27:24,371 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-01-19 14:27:24,371 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=303, PETRI_PLACES=139, PETRI_TRANSITIONS=130} [2022-01-19 14:27:24,373 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 14:27:24,373 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-01-19 14:27:24,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.42857142857143) internal successors, (815), 7 states have internal predecessors, (815), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:24,375 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:24,375 INFO L254 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] [2022-01-19 14:27:24,406 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-01-19 14:27:24,591 WARN L452 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-01-19 14:27:24,592 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:24,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:24,592 INFO L85 PathProgramCache]: Analyzing trace with hash -505819659, now seen corresponding path program 1 times [2022-01-19 14:27:24,592 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:24,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916005671] [2022-01-19 14:27:24,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:24,593 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:24,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:24,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:24,730 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:24,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916005671] [2022-01-19 14:27:24,731 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916005671] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:24,731 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [82122595] [2022-01-19 14:27:24,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:24,731 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:24,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:24,732 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:24,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-19 14:27:24,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:24,828 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 14:27:24,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:25,059 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:25,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:27:25,366 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:25,367 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [82122595] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:25,367 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:27:25,367 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-19 14:27:25,367 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1391543834] [2022-01-19 14:27:25,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:27:25,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 14:27:25,368 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:25,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 14:27:25,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-19 14:27:25,370 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-01-19 14:27:25,371 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 130 transitions, 303 flow. Second operand has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:25,371 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:25,372 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-01-19 14:27:25,372 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:25,666 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-01-19 14:27:25,666 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-01-19 14:27:25,669 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2530 conditions, 1273 events. 599/1273 cut-off events. For 404/585 co-relation queries the response was YES. Maximal size of possible extension queue 75. Compared 6934 event pairs, 124 based on Foata normal form. 181/1303 useless extension candidates. Maximal degree in co-relation 2522. Up to 249 conditions per place. [2022-01-19 14:27:25,677 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-01-19 14:27:25,677 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-01-19 14:27:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 14:27:25,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 14:27:25,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-01-19 14:27:25,680 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-01-19 14:27:25,680 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-01-19 14:27:25,680 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-01-19 14:27:25,681 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:25,681 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-01-19 14:27:25,684 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 113.9090909090909) internal successors, (1253), 11 states have internal predecessors, (1253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:25,686 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:25,687 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 153.0) internal successors, (1836), 12 states have internal predecessors, (1836), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:25,687 INFO L186 Difference]: Start difference. First operand has 139 places, 130 transitions, 303 flow. Second operand 11 states and 1253 transitions. [2022-01-19 14:27:25,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-01-19 14:27:25,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 182 transitions, 629 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-01-19 14:27:25,692 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-01-19 14:27:25,692 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=135, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=130, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=402, PETRI_PLACES=151, PETRI_TRANSITIONS=142} [2022-01-19 14:27:25,693 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-01-19 14:27:25,693 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-01-19 14:27:25,693 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 109.33333333333333) internal successors, (984), 9 states have internal predecessors, (984), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:25,693 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:25,694 INFO L254 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] [2022-01-19 14:27:25,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-19 14:27:25,916 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-01-19 14:27:25,917 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:25,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:25,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1014903075, now seen corresponding path program 2 times [2022-01-19 14:27:25,917 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:25,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480919011] [2022-01-19 14:27:25,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:25,918 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:25,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:26,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:26,054 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:26,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480919011] [2022-01-19 14:27:26,054 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480919011] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:26,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [656508807] [2022-01-19 14:27:26,054 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:27:26,054 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:26,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:26,056 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:26,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-19 14:27:26,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 14:27:26,145 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:27:26,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 14:27:26,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:26,492 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-19 14:27:26,493 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 14:27:26,493 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [656508807] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:27:26,493 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 14:27:26,493 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-01-19 14:27:26,493 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57616193] [2022-01-19 14:27:26,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:27:26,494 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 14:27:26,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 14:27:26,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-01-19 14:27:26,495 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-01-19 14:27:26,496 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 142 transitions, 402 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:26,496 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:26,496 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-01-19 14:27:26,496 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:26,759 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-01-19 14:27:26,760 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-01-19 14:27:26,763 INFO L84 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 833 events. 413/833 cut-off events. For 772/877 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3682 event pairs, 111 based on Foata normal form. 131/942 useless extension candidates. Maximal degree in co-relation 2149. Up to 334 conditions per place. [2022-01-19 14:27:26,767 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-01-19 14:27:26,767 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-01-19 14:27:26,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 14:27:26,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 14:27:26,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-01-19 14:27:26,770 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-01-19 14:27:26,770 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-01-19 14:27:26,770 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-01-19 14:27:26,771 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:26,771 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-01-19 14:27:26,773 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 107.125) internal successors, (857), 8 states have internal predecessors, (857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:26,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:26,775 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 153.0) internal successors, (1377), 9 states have internal predecessors, (1377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:26,775 INFO L186 Difference]: Start difference. First operand has 151 places, 142 transitions, 402 flow. Second operand 8 states and 857 transitions. [2022-01-19 14:27:26,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-01-19 14:27:26,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 150 places, 144 transitions, 488 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-01-19 14:27:26,782 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-01-19 14:27:26,783 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=379, PETRI_PLACES=150, PETRI_TRANSITIONS=136} [2022-01-19 14:27:26,783 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-01-19 14:27:26,784 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-01-19 14:27:26,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:26,784 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:26,784 INFO L254 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] [2022-01-19 14:27:26,816 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-01-19 14:27:27,007 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:27,008 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:27,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:27,008 INFO L85 PathProgramCache]: Analyzing trace with hash 1225204200, now seen corresponding path program 1 times [2022-01-19 14:27:27,008 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:27,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131522819] [2022-01-19 14:27:27,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:27,009 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:27,718 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:27,718 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:27,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131522819] [2022-01-19 14:27:27,719 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2131522819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:27,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1993222596] [2022-01-19 14:27:27,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:27,719 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:27,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:27,722 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:27,723 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-19 14:27:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:27,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 37 conjunts are in the unsatisfiable core [2022-01-19 14:27:27,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:29,566 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-19 14:27:29,570 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:27:29,571 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 36 [2022-01-19 14:27:29,712 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:29,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:27:30,017 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:27:30,017 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2022-01-19 14:27:30,780 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:30,780 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1993222596] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:27:30,780 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:27:30,780 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 24, 18] total 56 [2022-01-19 14:27:30,780 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567425224] [2022-01-19 14:27:30,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:27:30,781 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-01-19 14:27:30,781 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:30,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-01-19 14:27:30,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=2691, Unknown=0, NotChecked=0, Total=3080 [2022-01-19 14:27:30,786 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-01-19 14:27:30,789 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 379 flow. Second operand has 56 states, 56 states have (on average 68.39285714285714) internal successors, (3830), 56 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:30,789 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:30,790 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-01-19 14:27:30,790 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:36,242 INFO L129 PetriNetUnfolder]: 7004/11453 cut-off events. [2022-01-19 14:27:36,242 INFO L130 PetriNetUnfolder]: For 9233/9233 co-relation queries the response was YES. [2022-01-19 14:27:36,282 INFO L84 FinitePrefix]: Finished finitePrefix Result has 29290 conditions, 11453 events. 7004/11453 cut-off events. For 9233/9233 co-relation queries the response was YES. Maximal size of possible extension queue 541. Compared 79516 event pairs, 711 based on Foata normal form. 84/11378 useless extension candidates. Maximal degree in co-relation 29278. Up to 3532 conditions per place. [2022-01-19 14:27:36,350 INFO L132 encePairwiseOnDemand]: 110/153 looper letters, 431 selfloop transitions, 193 changer transitions 13/689 dead transitions. [2022-01-19 14:27:36,351 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 689 transitions, 3573 flow [2022-01-19 14:27:36,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-01-19 14:27:36,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2022-01-19 14:27:36,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 5413 transitions. [2022-01-19 14:27:36,366 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.47809574280162515 [2022-01-19 14:27:36,367 INFO L72 ComplementDD]: Start complementDD. Operand 74 states and 5413 transitions. [2022-01-19 14:27:36,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 74 states and 5413 transitions. [2022-01-19 14:27:36,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:36,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 74 states and 5413 transitions. [2022-01-19 14:27:36,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 75 states, 74 states have (on average 73.14864864864865) internal successors, (5413), 74 states have internal predecessors, (5413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:36,404 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 75 states, 75 states have (on average 153.0) internal successors, (11475), 75 states have internal predecessors, (11475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:36,407 INFO L81 ComplementDD]: Finished complementDD. Result has 75 states, 75 states have (on average 153.0) internal successors, (11475), 75 states have internal predecessors, (11475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:36,407 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 74 states and 5413 transitions. [2022-01-19 14:27:36,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 689 transitions, 3573 flow [2022-01-19 14:27:36,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 218 places, 689 transitions, 3509 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 14:27:36,514 INFO L242 Difference]: Finished difference. Result has 262 places, 325 transitions, 1831 flow [2022-01-19 14:27:36,514 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=145, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=74, PETRI_FLOW=1831, PETRI_PLACES=262, PETRI_TRANSITIONS=325} [2022-01-19 14:27:36,516 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 125 predicate places. [2022-01-19 14:27:36,517 INFO L470 AbstractCegarLoop]: Abstraction has has 262 places, 325 transitions, 1831 flow [2022-01-19 14:27:36,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 68.39285714285714) internal successors, (3830), 56 states have internal predecessors, (3830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:36,518 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:36,519 INFO L254 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] [2022-01-19 14:27:36,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-01-19 14:27:36,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:36,736 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:36,736 INFO L85 PathProgramCache]: Analyzing trace with hash 513619604, now seen corresponding path program 2 times [2022-01-19 14:27:36,736 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:36,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157558234] [2022-01-19 14:27:36,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:36,736 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:37,377 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:37,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157558234] [2022-01-19 14:27:37,377 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157558234] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:37,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819723852] [2022-01-19 14:27:37,377 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:27:37,378 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:37,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:37,379 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:37,380 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-19 14:27:37,465 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:27:37,466 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:27:37,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-19 14:27:37,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:38,224 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:27:38,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-01-19 14:27:38,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:38,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:27:39,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:27:39,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2022-01-19 14:27:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-19 14:27:39,778 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819723852] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:27:39,778 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:27:39,779 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 16, 15] total 42 [2022-01-19 14:27:39,779 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177862105] [2022-01-19 14:27:39,779 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:27:39,780 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-19 14:27:39,780 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:27:39,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-19 14:27:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2022-01-19 14:27:39,783 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 153 [2022-01-19 14:27:39,785 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 262 places, 325 transitions, 1831 flow. Second operand has 42 states, 42 states have (on average 70.28571428571429) internal successors, (2952), 42 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:39,785 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:27:39,786 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 153 [2022-01-19 14:27:39,786 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:27:44,880 INFO L129 PetriNetUnfolder]: 7974/13195 cut-off events. [2022-01-19 14:27:44,880 INFO L130 PetriNetUnfolder]: For 84287/84676 co-relation queries the response was YES. [2022-01-19 14:27:45,015 INFO L84 FinitePrefix]: Finished finitePrefix Result has 54371 conditions, 13195 events. 7974/13195 cut-off events. For 84287/84676 co-relation queries the response was YES. Maximal size of possible extension queue 636. Compared 96243 event pairs, 1643 based on Foata normal form. 45/13074 useless extension candidates. Maximal degree in co-relation 54316. Up to 7387 conditions per place. [2022-01-19 14:27:45,083 INFO L132 encePairwiseOnDemand]: 122/153 looper letters, 373 selfloop transitions, 165 changer transitions 19/611 dead transitions. [2022-01-19 14:27:45,084 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 301 places, 611 transitions, 4700 flow [2022-01-19 14:27:45,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-01-19 14:27:45,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2022-01-19 14:27:45,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 3226 transitions. [2022-01-19 14:27:45,091 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4792038027332145 [2022-01-19 14:27:45,091 INFO L72 ComplementDD]: Start complementDD. Operand 44 states and 3226 transitions. [2022-01-19 14:27:45,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 44 states and 3226 transitions. [2022-01-19 14:27:45,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:27:45,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 44 states and 3226 transitions. [2022-01-19 14:27:45,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 45 states, 44 states have (on average 73.31818181818181) internal successors, (3226), 44 states have internal predecessors, (3226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:45,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 45 states, 45 states have (on average 153.0) internal successors, (6885), 45 states have internal predecessors, (6885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:45,108 INFO L81 ComplementDD]: Finished complementDD. Result has 45 states, 45 states have (on average 153.0) internal successors, (6885), 45 states have internal predecessors, (6885), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:45,108 INFO L186 Difference]: Start difference. First operand has 262 places, 325 transitions, 1831 flow. Second operand 44 states and 3226 transitions. [2022-01-19 14:27:45,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 301 places, 611 transitions, 4700 flow [2022-01-19 14:27:45,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 284 places, 611 transitions, 4628 flow, removed 20 selfloop flow, removed 17 redundant places. [2022-01-19 14:27:45,570 INFO L242 Difference]: Finished difference. Result has 307 places, 416 transitions, 3071 flow [2022-01-19 14:27:45,571 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1775, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=325, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=83, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=207, PETRI_DIFFERENCE_SUBTRAHEND_STATES=44, PETRI_FLOW=3071, PETRI_PLACES=307, PETRI_TRANSITIONS=416} [2022-01-19 14:27:45,571 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 170 predicate places. [2022-01-19 14:27:45,571 INFO L470 AbstractCegarLoop]: Abstraction has has 307 places, 416 transitions, 3071 flow [2022-01-19 14:27:45,572 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 70.28571428571429) internal successors, (2952), 42 states have internal predecessors, (2952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:27:45,573 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:27:45,573 INFO L254 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] [2022-01-19 14:27:45,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-19 14:27:45,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:45,788 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:27:45,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:27:45,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1183853158, now seen corresponding path program 3 times [2022-01-19 14:27:45,788 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:27:45,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972075129] [2022-01-19 14:27:45,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:27:45,788 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:27:45,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:27:46,530 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:46,531 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:27:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972075129] [2022-01-19 14:27:46,531 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972075129] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:27:46,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434935766] [2022-01-19 14:27:46,531 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 14:27:46,531 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:27:46,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:27:46,536 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:27:46,564 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-19 14:27:46,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 14:27:46,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:27:46,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 14:27:46,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:27:47,500 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-19 14:27:47,952 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:27:48,049 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:27:48,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:27:48,646 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:27:48,647 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-01-19 14:27:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:27:49,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:27:50,576 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse3 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse0 (select .cse3 c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (let ((.cse2 (select .cse3 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse1 (< c_~max2~0 .cse2))) (and (or (= c_~max2~0 .cse0) .cse1) (or (not .cse1) (= .cse2 .cse0))))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse6 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse5 (< c_~max2~0 .cse4))) (and (or (= c_~max1~0 .cse4) (not .cse5)) (or (= c_~max1~0 c_~max2~0) .cse5)))) (< c_~max1~0 (select .cse6 c_~A~0.offset)))))) (<= (+ 2 c_~M~0) c_~N~0) (not (< c_~M~0 c_~N~0))) is different from false [2022-01-19 14:27:53,717 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< 0 ~M~0) (and (forall ((v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse0 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse1 (< c_~max2~0 .cse0))) (and (or (= c_~max1~0 .cse0) (not .cse1)) (or (= c_~max1~0 c_~max2~0) .cse1)))) (< c_~max1~0 (select .cse2 c_~A~0.offset))))) (forall ((v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (let ((.cse4 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse5 (< c_~max2~0 .cse4))) (and (or (= .cse3 .cse4) (not .cse5)) (or (= .cse3 c_~max2~0) .cse5))))))))))) is different from false [2022-01-19 14:27:56,504 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (< 0 ~M~0) (and (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse1 (select .cse2 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse0 (< c_~max2~0 .cse1))) (and (or (not .cse0) (= c_~max1~0 .cse1)) (or .cse0 (= c_~max1~0 c_~max2~0))))) (< c_~max1~0 (select .cse2 c_~A~0.offset))))) (forall ((v_ArrVal_223 (Array Int Int)) (v_ArrVal_225 (Array Int Int)) (v_ArrVal_224 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_224) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse4 (< c_~max2~0 .cse5))) (and (or (not .cse4) (= .cse3 .cse5)) (or .cse4 (= .cse3 c_~max2~0)))))))))))) is different from false [2022-01-19 14:28:05,852 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:05,853 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 316 treesize of output 209 [2022-01-19 14:28:05,882 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:05,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2593 treesize of output 2497 [2022-01-19 14:28:05,934 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:05,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2452 treesize of output 2385 [2022-01-19 14:28:05,975 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:05,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2372 treesize of output 2225 [2022-01-19 14:28:06,015 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:06,016 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2212 treesize of output 2185 [2022-01-19 14:28:06,058 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:06,059 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2172 treesize of output 2089 [2022-01-19 14:28:06,102 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:06,102 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2076 treesize of output 1897 [2022-01-19 14:28:06,146 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:06,147 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1884 treesize of output 1849 [2022-01-19 14:28:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:09,564 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434935766] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:28:09,564 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:28:09,564 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 31, 26] total 69 [2022-01-19 14:28:09,564 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694162198] [2022-01-19 14:28:09,564 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:28:09,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-01-19 14:28:09,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:09,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-01-19 14:28:09,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=634, Invalid=3602, Unknown=66, NotChecked=390, Total=4692 [2022-01-19 14:28:09,570 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 153 [2022-01-19 14:28:09,573 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 416 transitions, 3071 flow. Second operand has 69 states, 69 states have (on average 57.85507246376812) internal successors, (3992), 69 states have internal predecessors, (3992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:09,573 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:09,573 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 153 [2022-01-19 14:28:09,573 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:19,349 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max2~0 0)) (.cse2 (< 0 c_~max2~0)) (.cse0 (= c_~max1~0 0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (and .cse0 .cse1) (and .cse2 .cse3)) (<= 1 c_~N~0) (let ((.cse5 (< 0 c_~max1~0)) (.cse4 (<= c_thread3Thread1of1ForFork1_~i~2 1)) (.cse6 (< c_thread3Thread1of1ForFork1_~i~2 1))) (or (and .cse1 (or (and .cse0 .cse4) (and .cse5 .cse6))) (and .cse2 (or (and .cse5 (or .cse6 (and .cse3 .cse4))) (and .cse0 .cse6))))) (or (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse7 (select .cse10 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (let ((.cse9 (select .cse10 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse8 (< c_~max2~0 .cse9))) (and (or (= c_~max2~0 .cse7) .cse8) (or (not .cse8) (= .cse9 .cse7))))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse11 (select .cse13 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse12 (< c_~max2~0 .cse11))) (and (or (= c_~max1~0 .cse11) (not .cse12)) (or (= c_~max1~0 c_~max2~0) .cse12)))) (< c_~max1~0 (select .cse13 c_~A~0.offset)))))) (<= (+ 2 c_~M~0) c_~N~0) (not (< c_~M~0 c_~N~0))) (< 0 c_~N~0) (or .cse3 (<= 2 c_~N~0)) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse17 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse14 (select .cse17 c_~A~0.offset))) (or (not (< c_~max1~0 .cse14)) (let ((.cse15 (select .cse17 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse16 (< c_~max2~0 .cse15))) (and (or (= .cse15 .cse14) (not .cse16)) (or (= c_~max2~0 .cse14) .cse16)))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse20 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse19 (select .cse20 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse18 (< c_~max2~0 .cse19))) (and (or (= c_~max1~0 c_~max2~0) .cse18) (or (not .cse18) (= .cse19 c_~max1~0))))) (< c_~max1~0 (select .cse20 c_~A~0.offset)))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (or (let ((.cse26 (select |c_#memory_int| c_~A~0.base))) (let ((.cse23 (select .cse26 (+ c_~A~0.offset (* c_thread3Thread1of1ForFork1_~i~2 4))))) (let ((.cse25 (select .cse26 (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4)))) (.cse21 (< c_~max2~0 .cse23))) (let ((.cse22 (not .cse21)) (.cse24 (< c_~max1~0 .cse25))) (and (or (and (or .cse3 .cse21) (or .cse22 (= c_~max1~0 .cse23))) .cse24) (or (and (or .cse22 (= .cse25 .cse23)) (or .cse21 (= .cse25 c_~max2~0))) (not .cse24))))))) (<= (+ 2 c_thread3Thread1of1ForFork1_~i~2) c_~N~0) (not (< c_thread3Thread1of1ForFork1_~i~2 c_~N~0))))) is different from false [2022-01-19 14:28:23,518 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= c_~max2~0 0)) (.cse2 (< 0 c_~max2~0)) (.cse0 (= c_~max1~0 0)) (.cse3 (= c_~max1~0 c_~max2~0))) (and (or (and .cse0 .cse1) (and .cse2 .cse3)) (<= 1 c_~N~0) (let ((.cse5 (< 0 c_~max1~0)) (.cse4 (<= c_thread3Thread1of1ForFork1_~i~2 1)) (.cse6 (< c_thread3Thread1of1ForFork1_~i~2 1))) (or (and .cse1 (or (and .cse0 .cse4) (and .cse5 .cse6))) (and .cse2 (or (and .cse5 (or .cse6 (and .cse3 .cse4))) (and .cse0 .cse6))))) (< 0 c_~N~0) (or .cse3 (<= 2 c_~N~0)) (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (and (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (let ((.cse7 (select .cse10 c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (let ((.cse8 (select .cse10 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse9 (< c_~max2~0 .cse8))) (and (or (= .cse8 .cse7) (not .cse9)) (or (= c_~max2~0 .cse7) .cse9)))))))) (forall ((v_ArrVal_225 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_225) c_~A~0.base))) (or (let ((.cse12 (select .cse13 (+ c_~A~0.offset (* ~M~0 4))))) (let ((.cse11 (< c_~max2~0 .cse12))) (and (or (= c_~max1~0 c_~max2~0) .cse11) (or (not .cse11) (= .cse12 c_~max1~0))))) (< c_~max1~0 (select .cse13 c_~A~0.offset)))))) (< c_thread2Thread1of1ForFork0_~i~1 ~M~0))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0))) is different from false [2022-01-19 14:28:23,812 INFO L129 PetriNetUnfolder]: 10977/18712 cut-off events. [2022-01-19 14:28:23,812 INFO L130 PetriNetUnfolder]: For 151790/152126 co-relation queries the response was YES. [2022-01-19 14:28:23,950 INFO L84 FinitePrefix]: Finished finitePrefix Result has 86377 conditions, 18712 events. 10977/18712 cut-off events. For 151790/152126 co-relation queries the response was YES. Maximal size of possible extension queue 951. Compared 148364 event pairs, 2333 based on Foata normal form. 46/18537 useless extension candidates. Maximal degree in co-relation 86303. Up to 7863 conditions per place. [2022-01-19 14:28:24,063 INFO L132 encePairwiseOnDemand]: 106/153 looper letters, 556 selfloop transitions, 391 changer transitions 28/1023 dead transitions. [2022-01-19 14:28:24,063 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 387 places, 1023 transitions, 10299 flow [2022-01-19 14:28:24,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2022-01-19 14:28:24,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2022-01-19 14:28:24,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 5355 transitions. [2022-01-19 14:28:24,072 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4069767441860465 [2022-01-19 14:28:24,072 INFO L72 ComplementDD]: Start complementDD. Operand 86 states and 5355 transitions. [2022-01-19 14:28:24,072 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 5355 transitions. [2022-01-19 14:28:24,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:24,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 86 states and 5355 transitions. [2022-01-19 14:28:24,099 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 87 states, 86 states have (on average 62.26744186046512) internal successors, (5355), 86 states have internal predecessors, (5355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:24,120 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 87 states, 87 states have (on average 153.0) internal successors, (13311), 87 states have internal predecessors, (13311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:24,123 INFO L81 ComplementDD]: Finished complementDD. Result has 87 states, 87 states have (on average 153.0) internal successors, (13311), 87 states have internal predecessors, (13311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:24,123 INFO L186 Difference]: Start difference. First operand has 307 places, 416 transitions, 3071 flow. Second operand 86 states and 5355 transitions. [2022-01-19 14:28:24,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 387 places, 1023 transitions, 10299 flow [2022-01-19 14:28:25,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 368 places, 1023 transitions, 10068 flow, removed 86 selfloop flow, removed 19 redundant places. [2022-01-19 14:28:25,014 INFO L242 Difference]: Finished difference. Result has 415 places, 656 transitions, 6947 flow [2022-01-19 14:28:25,015 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=2966, PETRI_DIFFERENCE_MINUEND_PLACES=283, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=416, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=166, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=86, PETRI_FLOW=6947, PETRI_PLACES=415, PETRI_TRANSITIONS=656} [2022-01-19 14:28:25,015 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 278 predicate places. [2022-01-19 14:28:25,015 INFO L470 AbstractCegarLoop]: Abstraction has has 415 places, 656 transitions, 6947 flow [2022-01-19 14:28:25,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 57.85507246376812) internal successors, (3992), 69 states have internal predecessors, (3992), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:25,016 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:25,017 INFO L254 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] [2022-01-19 14:28:25,033 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-19 14:28:25,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:25,218 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:28:25,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:25,219 INFO L85 PathProgramCache]: Analyzing trace with hash 83737512, now seen corresponding path program 4 times [2022-01-19 14:28:25,219 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:25,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016488602] [2022-01-19 14:28:25,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:25,219 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:25,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:25,833 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:25,833 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:25,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016488602] [2022-01-19 14:28:25,833 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016488602] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:25,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063352285] [2022-01-19 14:28:25,834 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-19 14:28:25,834 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:25,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:25,835 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:28:25,835 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-19 14:28:25,908 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-19 14:28:25,909 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:28:25,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-19 14:28:25,912 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:26,946 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 14:28:26,946 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-01-19 14:28:27,140 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:27,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:27,361 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:27,362 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 55 [2022-01-19 14:28:28,018 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:28,018 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063352285] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:28:28,018 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:28:28,018 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 18] total 52 [2022-01-19 14:28:28,018 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858077353] [2022-01-19 14:28:28,019 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:28:28,019 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-01-19 14:28:28,019 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:28,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-01-19 14:28:28,020 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2240, Unknown=0, NotChecked=0, Total=2652 [2022-01-19 14:28:28,023 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 153 [2022-01-19 14:28:28,025 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 415 places, 656 transitions, 6947 flow. Second operand has 52 states, 52 states have (on average 71.61538461538461) internal successors, (3724), 52 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:28,025 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:28,025 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 153 [2022-01-19 14:28:28,025 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:35,876 INFO L129 PetriNetUnfolder]: 11974/21201 cut-off events. [2022-01-19 14:28:35,877 INFO L130 PetriNetUnfolder]: For 332724/333396 co-relation queries the response was YES. [2022-01-19 14:28:36,689 INFO L84 FinitePrefix]: Finished finitePrefix Result has 128670 conditions, 21201 events. 11974/21201 cut-off events. For 332724/333396 co-relation queries the response was YES. Maximal size of possible extension queue 1148. Compared 181123 event pairs, 1954 based on Foata normal form. 184/21106 useless extension candidates. Maximal degree in co-relation 128554. Up to 9378 conditions per place. [2022-01-19 14:28:36,835 INFO L132 encePairwiseOnDemand]: 112/153 looper letters, 546 selfloop transitions, 390 changer transitions 13/1024 dead transitions. [2022-01-19 14:28:36,835 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 451 places, 1024 transitions, 12952 flow [2022-01-19 14:28:36,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-01-19 14:28:36,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2022-01-19 14:28:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 3551 transitions. [2022-01-19 14:28:36,848 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.4938117090807954 [2022-01-19 14:28:36,848 INFO L72 ComplementDD]: Start complementDD. Operand 47 states and 3551 transitions. [2022-01-19 14:28:36,848 INFO L73 IsDeterministic]: Start isDeterministic. Operand 47 states and 3551 transitions. [2022-01-19 14:28:36,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:36,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 47 states and 3551 transitions. [2022-01-19 14:28:36,860 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 48 states, 47 states have (on average 75.55319148936171) internal successors, (3551), 47 states have internal predecessors, (3551), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:36,873 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:36,874 INFO L81 ComplementDD]: Finished complementDD. Result has 48 states, 48 states have (on average 153.0) internal successors, (7344), 48 states have internal predecessors, (7344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:36,874 INFO L186 Difference]: Start difference. First operand has 415 places, 656 transitions, 6947 flow. Second operand 47 states and 3551 transitions. [2022-01-19 14:28:36,874 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 451 places, 1024 transitions, 12952 flow [2022-01-19 14:28:39,375 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 418 places, 1024 transitions, 12022 flow, removed 439 selfloop flow, removed 33 redundant places. [2022-01-19 14:28:39,388 INFO L242 Difference]: Finished difference. Result has 435 places, 795 transitions, 9250 flow [2022-01-19 14:28:39,389 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=6276, PETRI_DIFFERENCE_MINUEND_PLACES=372, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=656, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=261, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=343, PETRI_DIFFERENCE_SUBTRAHEND_STATES=47, PETRI_FLOW=9250, PETRI_PLACES=435, PETRI_TRANSITIONS=795} [2022-01-19 14:28:39,389 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 298 predicate places. [2022-01-19 14:28:39,390 INFO L470 AbstractCegarLoop]: Abstraction has has 435 places, 795 transitions, 9250 flow [2022-01-19 14:28:39,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 71.61538461538461) internal successors, (3724), 52 states have internal predecessors, (3724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-19 14:28:39,390 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:39,391 INFO L254 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] [2022-01-19 14:28:39,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-01-19 14:28:39,614 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:39,615 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION] === [2022-01-19 14:28:39,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:39,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1482560342, now seen corresponding path program 5 times [2022-01-19 14:28:39,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:39,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018347281] [2022-01-19 14:28:39,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:39,616 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:40,473 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:40,474 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018347281] [2022-01-19 14:28:40,474 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018347281] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:40,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [884197920] [2022-01-19 14:28:40,474 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-19 14:28:40,474 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:40,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:40,475 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-19 14:28:40,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-19 14:28:40,556 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:28:40,557 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:28:40,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-19 14:28:40,560 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:41,154 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:28:41,588 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:28:41,682 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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-01-19 14:28:42,026 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:28:42,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2022-01-19 14:28:42,284 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:42,284 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 45 [2022-01-19 14:28:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-19 14:28:42,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:43,307 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (or (= c_~max1~0 c_~max2~0) (forall ((v_ArrVal_294 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))))) (not (< ~M~0 c_~N~0)))) is different from false [2022-01-19 14:28:43,741 WARN L838 $PredicateComparison]: unable to prove that (forall ((~M~0 Int)) (or (<= (+ 2 ~M~0) c_~N~0) (not (< ~M~0 c_~N~0)) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (forall ((v_ArrVal_294 (Array Int Int))) (< c_~max2~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))))) (.cse2 (< c_~max1~0 .cse4))) (and (or (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse0)) (= .cse0 c_~max1~0)))) (or (= c_~max1~0 c_~max2~0) .cse1)) .cse2) (or (and (forall ((v_ArrVal_294 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_294) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max2~0 .cse3)) (= .cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))))) (or .cse1 (= .cse4 c_~max2~0))) (not .cse2))))))) is different from false [2022-01-19 14:28:57,619 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:57,619 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 304 treesize of output 197 [2022-01-19 14:28:57,651 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:57,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15221 treesize of output 14013 [2022-01-19 14:28:57,759 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:57,759 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13968 treesize of output 13905 [2022-01-19 14:28:57,812 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13892 treesize of output 13796 [2022-01-19 14:28:57,864 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13796 treesize of output 13604 [2022-01-19 14:28:57,935 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:57,936 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13604 treesize of output 13465 [2022-01-19 14:28:58,021 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:58,022 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13452 treesize of output 12745 [2022-01-19 14:28:58,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12732 treesize of output 11004 [2022-01-19 14:28:58,163 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:58,164 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11004 treesize of output 9577 [2022-01-19 14:28:58,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9564 treesize of output 9468 [2022-01-19 14:28:58,266 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 14:28:58,269 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-19 14:28:58,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-01-19 14:28:58,483 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-19 14:28:58,484 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseConcurrentProgram(TraceAbstractionStarter.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-19 14:28:58,488 INFO L158 Benchmark]: Toolchain (without parser) took 97599.76ms. Allocated memory was 362.8MB in the beginning and 3.3GB in the end (delta: 3.0GB). Free memory was 305.9MB in the beginning and 2.4GB in the end (delta: -2.1GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2022-01-19 14:28:58,488 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 362.8MB. Free memory was 322.1MB in the beginning and 322.0MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 14:28:58,488 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.37ms. Allocated memory was 362.8MB in the beginning and 478.2MB in the end (delta: 115.3MB). Free memory was 305.7MB in the beginning and 446.7MB in the end (delta: -141.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. [2022-01-19 14:28:58,488 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.88ms. Allocated memory is still 478.2MB. Free memory was 446.7MB in the beginning and 445.7MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 14:28:58,489 INFO L158 Benchmark]: Boogie Preprocessor took 34.62ms. Allocated memory is still 478.2MB. Free memory was 445.7MB in the beginning and 443.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. [2022-01-19 14:28:58,489 INFO L158 Benchmark]: RCFGBuilder took 473.02ms. Allocated memory is still 478.2MB. Free memory was 443.6MB in the beginning and 424.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 14:28:58,489 INFO L158 Benchmark]: TraceAbstraction took 96660.57ms. Allocated memory was 478.2MB in the beginning and 3.3GB in the end (delta: 2.8GB). Free memory was 423.7MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. [2022-01-19 14:28:58,490 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.12ms. Allocated memory is still 362.8MB. Free memory was 322.1MB in the beginning and 322.0MB in the end (delta: 69.5kB). There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 372.37ms. Allocated memory was 362.8MB in the beginning and 478.2MB in the end (delta: 115.3MB). Free memory was 305.7MB in the beginning and 446.7MB in the end (delta: -141.1MB). Peak memory consumption was 9.3MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 53.88ms. Allocated memory is still 478.2MB. Free memory was 446.7MB in the beginning and 445.7MB in the end (delta: 997.2kB). There was no memory consumed. Max. memory is 16.0GB. * Boogie Preprocessor took 34.62ms. Allocated memory is still 478.2MB. Free memory was 445.7MB in the beginning and 443.6MB in the end (delta: 2.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.0GB. * RCFGBuilder took 473.02ms. Allocated memory is still 478.2MB. Free memory was 443.6MB in the beginning and 424.8MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 96660.57ms. Allocated memory was 478.2MB in the beginning and 3.3GB in the end (delta: 2.8GB). Free memory was 423.7MB in the beginning and 2.4GB in the end (delta: -2.0GB). Peak memory consumption was 1.2GB. Max. memory is 16.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-19 14:28:58,533 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 0 Received shutdown request...