/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-min-array.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-bf34d27 [2022-01-19 14:27:58,854 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-19 14:27:58,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-19 14:27:58,900 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-19 14:27:58,900 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-19 14:27:58,901 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-19 14:27:58,911 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-19 14:27:58,920 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-19 14:27:58,922 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-19 14:27:58,927 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-19 14:27:58,928 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-19 14:27:58,929 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-19 14:27:58,929 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-19 14:27:58,931 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-19 14:27:58,934 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-19 14:27:58,935 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-19 14:27:58,936 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-19 14:27:58,936 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-19 14:27:58,937 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-19 14:27:58,939 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-19 14:27:58,940 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-19 14:27:58,945 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-19 14:27:58,946 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-19 14:27:58,947 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-19 14:27:58,954 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-19 14:27:58,954 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-19 14:27:58,954 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-19 14:27:58,956 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-19 14:27:58,956 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-19 14:27:58,957 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-19 14:27:58,957 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-19 14:27:58,958 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-19 14:27:58,959 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-19 14:27:58,960 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-19 14:27:58,961 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-19 14:27:58,961 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-19 14:27:58,962 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-19 14:27:58,962 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-19 14:27:58,962 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-19 14:27:58,963 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-19 14:27:58,963 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-19 14:27:58,966 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:58,997 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-19 14:27:58,997 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-19 14:27:58,998 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-19 14:27:58,998 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-19 14:27:58,999 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-19 14:27:58,999 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-19 14:27:58,999 INFO L138 SettingsManager]: * Use SBE=true [2022-01-19 14:27:58,999 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-19 14:27:58,999 INFO L138 SettingsManager]: * sizeof long=4 [2022-01-19 14:27:58,999 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-19 14:27:59,000 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-01-19 14:27:59,000 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-19 14:27:59,000 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * sizeof long double=12 [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * Use constant arrays=true [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-19 14:27:59,001 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-19 14:27:59,001 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:27:59,002 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-19 14:27:59,002 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-19 14:27:59,003 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-19 14:27:59,003 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-19 14:27:59,003 INFO L138 SettingsManager]: * When to check the insufficient erros location relative to the other error locations=AFTER [2022-01-19 14:27:59,003 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:59,171 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-19 14:27:59,192 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-19 14:27:59,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-19 14:27:59,195 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-19 14:27:59,198 INFO L275 PluginConnector]: CDTParser initialized [2022-01-19 14:27:59,199 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-01-19 14:27:59,263 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cebf31c5/5155b0b8fcd94108bbdbcffa7bb85e1e/FLAGe65460f83 [2022-01-19 14:27:59,593 INFO L306 CDTParser]: Found 1 translation units. [2022-01-19 14:27:59,593 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-more-min-array.wvr.c [2022-01-19 14:27:59,607 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cebf31c5/5155b0b8fcd94108bbdbcffa7bb85e1e/FLAGe65460f83 [2022-01-19 14:28:00,012 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0cebf31c5/5155b0b8fcd94108bbdbcffa7bb85e1e [2022-01-19 14:28:00,014 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-19 14:28:00,015 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-19 14:28:00,017 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-19 14:28:00,017 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-19 14:28:00,020 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-19 14:28:00,020 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@542a513b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00, skipping insertion in model container [2022-01-19 14:28:00,021 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,027 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-19 14:28:00,042 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-19 14:28:00,185 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-min-array.wvr.c[2553,2566] [2022-01-19 14:28:00,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:28:00,212 INFO L203 MainTranslator]: Completed pre-run [2022-01-19 14:28:00,244 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-min-array.wvr.c[2553,2566] [2022-01-19 14:28:00,252 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-19 14:28:00,268 INFO L208 MainTranslator]: Completed translation [2022-01-19 14:28:00,268 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00 WrapperNode [2022-01-19 14:28:00,269 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-19 14:28:00,270 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-19 14:28:00,270 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-19 14:28:00,270 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-19 14:28:00,275 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:28:00" (1/1) ... [2022-01-19 14:28:00,290 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:28:00" (1/1) ... [2022-01-19 14:28:00,314 INFO L137 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 101 [2022-01-19 14:28:00,315 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-19 14:28:00,316 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-19 14:28:00,316 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-19 14:28:00,316 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-19 14:28:00,323 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,323 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,336 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,337 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,345 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,357 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,359 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-19 14:28:00,360 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-19 14:28:00,360 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-19 14:28:00,360 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-19 14:28:00,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (1/1) ... [2022-01-19 14:28:00,368 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-19 14:28:00,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:00,392 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:28:00,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:28:00,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-01-19 14:28:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-01-19 14:28:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-01-19 14:28:00,424 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-19 14:28:00,424 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-19 14:28:00,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-01-19 14:28:00,425 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-19 14:28:00,426 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:28:00,492 INFO L234 CfgBuilder]: Building ICFG [2022-01-19 14:28:00,493 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-19 14:28:00,681 INFO L275 CfgBuilder]: Performing block encoding [2022-01-19 14:28:00,759 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-19 14:28:00,760 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-19 14:28:00,765 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:28:00 BoogieIcfgContainer [2022-01-19 14:28:00,765 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-19 14:28:00,767 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-19 14:28:00,767 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-19 14:28:00,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-19 14:28:00,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.01 02:28:00" (1/3) ... [2022-01-19 14:28:00,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ae31a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:28:00, skipping insertion in model container [2022-01-19 14:28:00,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.01 02:28:00" (2/3) ... [2022-01-19 14:28:00,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71ae31a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.01 02:28:00, skipping insertion in model container [2022-01-19 14:28:00,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.01 02:28:00" (3/3) ... [2022-01-19 14:28:00,780 INFO L111 eAbstractionObserver]: Analyzing ICFG popl20-more-min-array.wvr.c [2022-01-19 14:28:00,784 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-19 14:28:00,784 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-19 14:28:00,784 INFO L534 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-01-19 14:28:00,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,830 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,831 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,831 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,832 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,833 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,833 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,834 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,834 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,834 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,835 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,836 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,836 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,836 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,836 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,837 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,837 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,837 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,837 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,838 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,839 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,839 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,840 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,840 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,841 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,842 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,842 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,842 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,842 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,843 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,843 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,843 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,843 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,844 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,845 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,845 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,845 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,845 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,846 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,846 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,846 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,846 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,847 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,850 WARN L322 ript$VariableManager]: TermVariabe thread2Thread1of1ForFork0_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,850 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~post4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,851 WARN L322 ript$VariableManager]: TermVariabe |thread2Thread1of1ForFork0_#t~mem5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe thread3Thread1of1ForFork1_~i~2 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~mem8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,852 WARN L322 ript$VariableManager]: TermVariabe |thread3Thread1of1ForFork1_#t~post7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,853 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~mem3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,853 WARN L322 ript$VariableManager]: TermVariabe thread1Thread1of1ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#t~post1| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,854 WARN L322 ript$VariableManager]: TermVariabe |thread1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2022-01-19 14:28:00,858 INFO L148 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-01-19 14:28:00,896 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-19 14:28:00,901 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:28:00,901 INFO L340 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-01-19 14:28:00,912 INFO L74 FinitePrefix]: Start finitePrefix. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 14:28:00,969 INFO L129 PetriNetUnfolder]: 12/150 cut-off events. [2022-01-19 14:28:00,969 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 14:28:00,974 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:28:00,974 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 153 transitions, 330 flow [2022-01-19 14:28:00,979 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 137 places, 139 transitions, 296 flow [2022-01-19 14:28:01,031 INFO L129 PetriNetUnfolder]: 12/138 cut-off events. [2022-01-19 14:28:01,035 INFO L130 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-01-19 14:28:01,035 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:01,036 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:28:01,036 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:28:01,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:01,041 INFO L85 PathProgramCache]: Analyzing trace with hash -977644638, now seen corresponding path program 1 times [2022-01-19 14:28:01,048 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:01,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777715450] [2022-01-19 14:28:01,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:01,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:01,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:01,297 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:28:01,297 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:01,297 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777715450] [2022-01-19 14:28:01,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777715450] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:28:01,298 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:28:01,298 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-19 14:28:01,300 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552271136] [2022-01-19 14:28:01,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:28:01,309 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-19 14:28:01,309 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:01,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-19 14:28:01,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-19 14:28:01,346 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 153 [2022-01-19 14:28:01,353 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:28:01,353 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:01,353 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 153 [2022-01-19 14:28:01,354 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:01,479 INFO L129 PetriNetUnfolder]: 41/264 cut-off events. [2022-01-19 14:28:01,480 INFO L130 PetriNetUnfolder]: For 50/51 co-relation queries the response was YES. [2022-01-19 14:28:01,484 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:28:01,486 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 9 selfloop transitions, 0 changer transitions 4/131 dead transitions. [2022-01-19 14:28:01,486 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 138 places, 131 transitions, 298 flow [2022-01-19 14:28:01,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-19 14:28:01,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-01-19 14:28:01,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 287 transitions. [2022-01-19 14:28:01,505 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.9379084967320261 [2022-01-19 14:28:01,506 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 287 transitions. [2022-01-19 14:28:01,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 287 transitions. [2022-01-19 14:28:01,509 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:01,511 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 287 transitions. [2022-01-19 14:28:01,516 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:28:01,523 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:28:01,523 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:28:01,525 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:28:01,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 138 places, 131 transitions, 298 flow [2022-01-19 14:28:01,530 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:28:01,533 INFO L242 Difference]: Finished difference. Result has 132 places, 127 transitions, 260 flow [2022-01-19 14:28:01,534 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:28:01,539 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, -5 predicate places. [2022-01-19 14:28:01,539 INFO L470 AbstractCegarLoop]: Abstraction has has 132 places, 127 transitions, 260 flow [2022-01-19 14:28:01,540 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:28:01,540 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:01,540 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:28:01,540 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-19 14:28:01,541 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:28:01,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:01,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1446866490, now seen corresponding path program 1 times [2022-01-19 14:28:01,544 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:01,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708407575] [2022-01-19 14:28:01,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:01,545 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:01,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:01,877 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:28:01,878 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:01,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708407575] [2022-01-19 14:28:01,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708407575] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:28:01,879 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-19 14:28:01,879 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-19 14:28:01,879 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657812372] [2022-01-19 14:28:01,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:28:01,881 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-19 14:28:01,881 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:01,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-19 14:28:01,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-01-19 14:28:01,884 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 153 [2022-01-19 14:28:01,885 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:28:01,886 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:01,886 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 153 [2022-01-19 14:28:01,886 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:02,111 INFO L129 PetriNetUnfolder]: 295/678 cut-off events. [2022-01-19 14:28:02,112 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 14:28:02,114 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:28:02,118 INFO L132 encePairwiseOnDemand]: 143/153 looper letters, 44 selfloop transitions, 6 changer transitions 4/135 dead transitions. [2022-01-19 14:28:02,118 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 135 transitions, 384 flow [2022-01-19 14:28:02,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 14:28:02,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 14:28:02,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 807 transitions. [2022-01-19 14:28:02,121 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.6593137254901961 [2022-01-19 14:28:02,121 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 807 transitions. [2022-01-19 14:28:02,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 807 transitions. [2022-01-19 14:28:02,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:02,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 807 transitions. [2022-01-19 14:28:02,124 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:28:02,127 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:28:02,128 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:28:02,128 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:28:02,128 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 135 transitions, 384 flow [2022-01-19 14:28:02,129 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:28:02,132 INFO L242 Difference]: Finished difference. Result has 139 places, 128 transitions, 288 flow [2022-01-19 14:28:02,132 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:28:02,133 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 14:28:02,133 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 128 transitions, 288 flow [2022-01-19 14:28:02,133 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:28:02,134 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:02,134 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:28:02,134 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-19 14:28:02,134 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:28:02,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:02,135 INFO L85 PathProgramCache]: Analyzing trace with hash -312552496, now seen corresponding path program 1 times [2022-01-19 14:28:02,135 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:02,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106178876] [2022-01-19 14:28:02,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:02,136 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:02,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:02,269 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:28:02,269 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:02,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106178876] [2022-01-19 14:28:02,269 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106178876] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:02,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371501262] [2022-01-19 14:28:02,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:02,270 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:02,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:02,275 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:28:02,302 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:28:02,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:02,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 6 conjunts are in the unsatisfiable core [2022-01-19 14:28:02,383 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:02,677 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:28:02,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:02,982 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:28:02,983 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371501262] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:02,983 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:28:02,983 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-01-19 14:28:02,984 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923618796] [2022-01-19 14:28:02,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:28:02,984 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-19 14:28:02,984 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:02,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-19 14:28:02,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-01-19 14:28:02,987 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 153 [2022-01-19 14:28:02,988 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:28:02,988 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:02,988 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 153 [2022-01-19 14:28:02,988 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:03,144 INFO L129 PetriNetUnfolder]: 175/510 cut-off events. [2022-01-19 14:28:03,144 INFO L130 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-01-19 14:28:03,146 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:28:03,149 INFO L132 encePairwiseOnDemand]: 145/153 looper letters, 33 selfloop transitions, 7 changer transitions 0/136 dead transitions. [2022-01-19 14:28:03,150 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 136 transitions, 386 flow [2022-01-19 14:28:03,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-19 14:28:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-01-19 14:28:03,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 831 transitions. [2022-01-19 14:28:03,152 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7759103641456583 [2022-01-19 14:28:03,152 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 831 transitions. [2022-01-19 14:28:03,152 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 831 transitions. [2022-01-19 14:28:03,153 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:03,153 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 831 transitions. [2022-01-19 14:28:03,155 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:28:03,156 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:28:03,157 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:28:03,157 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:28:03,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 136 transitions, 386 flow [2022-01-19 14:28:03,160 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:28:03,164 INFO L242 Difference]: Finished difference. Result has 139 places, 130 transitions, 303 flow [2022-01-19 14:28:03,164 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:28:03,166 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 2 predicate places. [2022-01-19 14:28:03,166 INFO L470 AbstractCegarLoop]: Abstraction has has 139 places, 130 transitions, 303 flow [2022-01-19 14:28:03,166 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:28:03,168 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:03,168 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:28:03,196 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-19 14:28:03,391 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:28:03,391 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:28:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:03,392 INFO L85 PathProgramCache]: Analyzing trace with hash -505819659, now seen corresponding path program 1 times [2022-01-19 14:28:03,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:03,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113555416] [2022-01-19 14:28:03,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:03,392 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:03,559 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:28:03,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:03,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113555416] [2022-01-19 14:28:03,563 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113555416] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:03,564 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897867473] [2022-01-19 14:28:03,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:03,564 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:03,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:03,565 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:28:03,566 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:28:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:03,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-19 14:28:03,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:03,928 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:28:03,929 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:04,287 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:28:04,287 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897867473] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:04,287 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-19 14:28:04,287 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-01-19 14:28:04,287 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530970383] [2022-01-19 14:28:04,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:28:04,288 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-19 14:28:04,288 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:04,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-19 14:28:04,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-01-19 14:28:04,290 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 153 [2022-01-19 14:28:04,291 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:28:04,291 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:04,291 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 153 [2022-01-19 14:28:04,291 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:04,589 INFO L129 PetriNetUnfolder]: 599/1273 cut-off events. [2022-01-19 14:28:04,589 INFO L130 PetriNetUnfolder]: For 404/585 co-relation queries the response was YES. [2022-01-19 14:28:04,592 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:28:04,598 INFO L132 encePairwiseOnDemand]: 141/153 looper letters, 74 selfloop transitions, 19 changer transitions 0/182 dead transitions. [2022-01-19 14:28:04,599 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 149 places, 182 transitions, 642 flow [2022-01-19 14:28:04,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-19 14:28:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-01-19 14:28:04,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1253 transitions. [2022-01-19 14:28:04,602 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.744503862150921 [2022-01-19 14:28:04,602 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1253 transitions. [2022-01-19 14:28:04,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1253 transitions. [2022-01-19 14:28:04,603 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:04,603 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1253 transitions. [2022-01-19 14:28:04,605 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:28:04,608 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:28:04,608 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:28:04,608 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:28:04,608 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 149 places, 182 transitions, 642 flow [2022-01-19 14:28:04,610 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:28:04,612 INFO L242 Difference]: Finished difference. Result has 151 places, 142 transitions, 402 flow [2022-01-19 14:28:04,613 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:28:04,613 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 14 predicate places. [2022-01-19 14:28:04,613 INFO L470 AbstractCegarLoop]: Abstraction has has 151 places, 142 transitions, 402 flow [2022-01-19 14:28:04,614 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:28:04,614 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:04,614 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:28:04,632 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-19 14:28:04,823 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:28:04,823 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:28:04,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:04,824 INFO L85 PathProgramCache]: Analyzing trace with hash 1014903075, now seen corresponding path program 2 times [2022-01-19 14:28:04,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:04,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122896330] [2022-01-19 14:28:04,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:04,824 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:04,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:04,952 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:28:04,952 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:04,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122896330] [2022-01-19 14:28:04,952 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122896330] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:04,953 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888289610] [2022-01-19 14:28:04,953 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:28:04,953 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:04,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:04,954 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:28:04,986 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:28:05,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-19 14:28:05,046 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:28:05,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 7 conjunts are in the unsatisfiable core [2022-01-19 14:28:05,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:05,463 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:28:05,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-19 14:28:05,463 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888289610] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-19 14:28:05,463 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-19 14:28:05,463 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-01-19 14:28:05,463 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825906489] [2022-01-19 14:28:05,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-19 14:28:05,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-19 14:28:05,464 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:05,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-19 14:28:05,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-01-19 14:28:05,467 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 153 [2022-01-19 14:28:05,468 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:28:05,468 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:05,468 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 153 [2022-01-19 14:28:05,468 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:05,702 INFO L129 PetriNetUnfolder]: 413/833 cut-off events. [2022-01-19 14:28:05,702 INFO L130 PetriNetUnfolder]: For 772/877 co-relation queries the response was YES. [2022-01-19 14:28:05,705 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:28:05,710 INFO L132 encePairwiseOnDemand]: 144/153 looper letters, 42 selfloop transitions, 11 changer transitions 0/144 dead transitions. [2022-01-19 14:28:05,710 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 156 places, 144 transitions, 501 flow [2022-01-19 14:28:05,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-19 14:28:05,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-01-19 14:28:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 857 transitions. [2022-01-19 14:28:05,713 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.7001633986928104 [2022-01-19 14:28:05,713 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 857 transitions. [2022-01-19 14:28:05,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 857 transitions. [2022-01-19 14:28:05,713 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:05,713 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 857 transitions. [2022-01-19 14:28:05,715 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:28:05,717 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:28:05,717 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:28:05,717 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:28:05,717 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 156 places, 144 transitions, 501 flow [2022-01-19 14:28:05,721 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:28:05,723 INFO L242 Difference]: Finished difference. Result has 150 places, 136 transitions, 379 flow [2022-01-19 14:28:05,724 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:28:05,724 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 13 predicate places. [2022-01-19 14:28:05,724 INFO L470 AbstractCegarLoop]: Abstraction has has 150 places, 136 transitions, 379 flow [2022-01-19 14:28:05,725 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:28:05,725 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:05,725 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:05,755 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:28:05,935 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:28:05,935 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:28:05,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:05,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1225204200, now seen corresponding path program 1 times [2022-01-19 14:28:05,936 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:05,936 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241140587] [2022-01-19 14:28:05,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:05,937 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:06,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:06,717 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:06,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241140587] [2022-01-19 14:28:06,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241140587] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:06,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133898657] [2022-01-19 14:28:06,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:06,718 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:06,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:06,719 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:28:06,730 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:28:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:06,833 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-19 14:28:06,840 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:06,903 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 14:28:06,938 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-19 14:28:06,939 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-01-19 14:28:07,009 INFO L353 Elim1Store]: treesize reduction 28, result has 40.4 percent of original size [2022-01-19 14:28:07,010 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 17 treesize of output 30 [2022-01-19 14:28:07,655 INFO L353 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2022-01-19 14:28:07,656 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 34 [2022-01-19 14:28:07,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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:08,632 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 14:28:08,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-19 14:28:08,986 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:09,556 INFO L353 Elim1Store]: treesize reduction 9, result has 25.0 percent of original size [2022-01-19 14:28:09,557 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:09,722 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:09,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:11,337 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse3 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (let ((.cse2 (select .cse3 c_~A~0.offset))) (or (let ((.cse1 (select .cse3 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse0 (< .cse1 c_~min2~0))) (and (or (not .cse0) (= .cse1 .cse2)) (or (= c_~min2~0 .cse2) .cse0)))) (not (< .cse2 c_~min1~0)))))) (forall ((v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (or (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse4 (< .cse5 c_~min2~0))) (and (or (= c_~min2~0 c_~min1~0) .cse4) (or (= c_~min1~0 .cse5) (not .cse4))))) (< (select .cse6 c_~A~0.offset) c_~min1~0))))) is different from false [2022-01-19 14:28:11,474 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) c_~min1~0) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse2 (< .cse1 c_~min2~0))) (and (or (= c_~min1~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2))))))) (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse4 (< .cse5 c_~min2~0))) (and (or (= c_~min2~0 .cse3) .cse4) (or (= .cse3 .cse5) (not .cse4))))) (not (< .cse3 c_~min1~0))))))) is different from false [2022-01-19 14:28:11,775 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) c_~min1~0) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse2 (< .cse1 c_~min2~0))) (and (or (= c_~min1~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2))))))) (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse4 (< .cse5 c_~min2~0))) (and (or (= c_~min2~0 .cse3) .cse4) (or (= .cse3 .cse5) (not .cse4))))) (not (< .cse3 c_~min1~0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-01-19 14:28:11,856 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (or (< (select .cse0 c_~A~0.offset) c_~min1~0) (let ((.cse1 (select .cse0 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse2 (< .cse1 c_~min2~0))) (and (or (= c_~min1~0 .cse1) (not .cse2)) (or (= c_~min2~0 c_~min1~0) .cse2))))))) (forall ((v_ArrVal_162 (Array Int Int)) (v_ArrVal_164 (Array Int Int)) (v_ArrVal_163 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_162) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_163) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_164) c_~A~0.base))) (let ((.cse3 (select .cse6 c_~A~0.offset))) (or (let ((.cse5 (select .cse6 (+ c_~A~0.offset (* 4 c_~M~0))))) (let ((.cse4 (< .cse5 c_~min2~0))) (and (or (= c_~min2~0 .cse3) .cse4) (or (= .cse3 .cse5) (not .cse4))))) (not (< .cse3 c_~min1~0))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-01-19 14:28:17,579 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,579 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:17,605 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,606 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 1853 treesize of output 1793 [2022-01-19 14:28:17,649 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,650 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 1748 treesize of output 1721 [2022-01-19 14:28:17,682 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,683 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 1708 treesize of output 1641 [2022-01-19 14:28:17,715 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,716 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 1628 treesize of output 1481 [2022-01-19 14:28:17,748 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,749 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 1468 treesize of output 1385 [2022-01-19 14:28:17,782 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,782 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 1372 treesize of output 1337 [2022-01-19 14:28:17,817 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:17,818 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 1324 treesize of output 1313 [2022-01-19 14:28:33,078 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:33,079 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133898657] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:28:33,079 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:28:33,080 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 30, 28] total 73 [2022-01-19 14:28:33,080 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410147670] [2022-01-19 14:28:33,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:28:33,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-01-19 14:28:33,080 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:33,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-01-19 14:28:33,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=647, Invalid=3974, Unknown=87, NotChecked=548, Total=5256 [2022-01-19 14:28:33,086 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 153 [2022-01-19 14:28:33,090 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 150 places, 136 transitions, 379 flow. Second operand has 73 states, 73 states have (on average 57.76712328767123) internal successors, (4217), 73 states have internal predecessors, (4217), 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:33,090 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:33,090 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 153 [2022-01-19 14:28:33,090 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:38,674 INFO L129 PetriNetUnfolder]: 4355/7238 cut-off events. [2022-01-19 14:28:38,674 INFO L130 PetriNetUnfolder]: For 6145/6158 co-relation queries the response was YES. [2022-01-19 14:28:38,716 INFO L84 FinitePrefix]: Finished finitePrefix Result has 18697 conditions, 7238 events. 4355/7238 cut-off events. For 6145/6158 co-relation queries the response was YES. Maximal size of possible extension queue 426. Compared 48174 event pairs, 522 based on Foata normal form. 3/7099 useless extension candidates. Maximal degree in co-relation 18685. Up to 2328 conditions per place. [2022-01-19 14:28:38,775 INFO L132 encePairwiseOnDemand]: 107/153 looper letters, 280 selfloop transitions, 109 changer transitions 14/452 dead transitions. [2022-01-19 14:28:38,775 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 199 places, 452 transitions, 2315 flow [2022-01-19 14:28:38,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-01-19 14:28:38,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2022-01-19 14:28:38,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 3127 transitions. [2022-01-19 14:28:38,786 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.40875816993464054 [2022-01-19 14:28:38,786 INFO L72 ComplementDD]: Start complementDD. Operand 50 states and 3127 transitions. [2022-01-19 14:28:38,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 50 states and 3127 transitions. [2022-01-19 14:28:38,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:38,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 50 states and 3127 transitions. [2022-01-19 14:28:38,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 51 states, 50 states have (on average 62.54) internal successors, (3127), 50 states have internal predecessors, (3127), 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:38,813 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 51 states, 51 states have (on average 153.0) internal successors, (7803), 51 states have internal predecessors, (7803), 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:38,818 INFO L81 ComplementDD]: Finished complementDD. Result has 51 states, 51 states have (on average 153.0) internal successors, (7803), 51 states have internal predecessors, (7803), 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:38,818 INFO L186 Difference]: Start difference. First operand has 150 places, 136 transitions, 379 flow. Second operand 50 states and 3127 transitions. [2022-01-19 14:28:38,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 199 places, 452 transitions, 2315 flow [2022-01-19 14:28:38,871 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 194 places, 452 transitions, 2263 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-01-19 14:28:38,880 INFO L242 Difference]: Finished difference. Result has 224 places, 236 transitions, 1195 flow [2022-01-19 14:28:38,881 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=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=50, PETRI_FLOW=1195, PETRI_PLACES=224, PETRI_TRANSITIONS=236} [2022-01-19 14:28:38,884 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 87 predicate places. [2022-01-19 14:28:38,884 INFO L470 AbstractCegarLoop]: Abstraction has has 224 places, 236 transitions, 1195 flow [2022-01-19 14:28:38,886 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 57.76712328767123) internal successors, (4217), 73 states have internal predecessors, (4217), 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:38,886 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:38,886 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:38,915 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:28:39,107 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:28:39,108 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:28:39,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash -1484120578, now seen corresponding path program 2 times [2022-01-19 14:28:39,108 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:39,108 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069808347] [2022-01-19 14:28:39,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:39,108 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:39,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:39,859 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:39,859 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069808347] [2022-01-19 14:28:39,859 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069808347] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:39,859 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1520096106] [2022-01-19 14:28:39,860 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-19 14:28:39,860 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:39,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:39,861 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:28:39,861 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:28:39,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-19 14:28:39,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:28:39,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-19 14:28:39,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:40,587 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:40,587 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:41,188 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:28:41,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:41,376 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:41,376 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:41,899 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:28:41,899 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1520096106] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-19 14:28:41,899 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-19 14:28:41,899 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 15] total 43 [2022-01-19 14:28:41,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673671927] [2022-01-19 14:28:41,900 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-19 14:28:41,900 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-19 14:28:41,900 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-19 14:28:41,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-19 14:28:41,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=1535, Unknown=0, NotChecked=0, Total=1806 [2022-01-19 14:28:41,904 INFO L499 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 153 [2022-01-19 14:28:41,906 INFO L92 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 236 transitions, 1195 flow. Second operand has 43 states, 43 states have (on average 69.25581395348837) internal successors, (2978), 43 states have internal predecessors, (2978), 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:41,906 INFO L101 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-01-19 14:28:41,907 INFO L102 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 153 [2022-01-19 14:28:41,907 INFO L74 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-01-19 14:28:47,694 INFO L129 PetriNetUnfolder]: 8600/14238 cut-off events. [2022-01-19 14:28:47,694 INFO L130 PetriNetUnfolder]: For 29258/29322 co-relation queries the response was YES. [2022-01-19 14:28:47,812 INFO L84 FinitePrefix]: Finished finitePrefix Result has 46483 conditions, 14238 events. 8600/14238 cut-off events. For 29258/29322 co-relation queries the response was YES. Maximal size of possible extension queue 773. Compared 104918 event pairs, 1410 based on Foata normal form. 11/14122 useless extension candidates. Maximal degree in co-relation 46442. Up to 6492 conditions per place. [2022-01-19 14:28:47,890 INFO L132 encePairwiseOnDemand]: 118/153 looper letters, 464 selfloop transitions, 201 changer transitions 14/731 dead transitions. [2022-01-19 14:28:47,890 INFO L138 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 277 places, 731 transitions, 5088 flow [2022-01-19 14:28:47,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-01-19 14:28:47,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2022-01-19 14:28:47,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 4438 transitions. [2022-01-19 14:28:47,902 INFO L544 CegarLoopForPetriNet]: DFA transition density 0.483442265795207 [2022-01-19 14:28:47,902 INFO L72 ComplementDD]: Start complementDD. Operand 60 states and 4438 transitions. [2022-01-19 14:28:47,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 60 states and 4438 transitions. [2022-01-19 14:28:47,904 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-01-19 14:28:47,904 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 60 states and 4438 transitions. [2022-01-19 14:28:47,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 61 states, 60 states have (on average 73.96666666666667) internal successors, (4438), 60 states have internal predecessors, (4438), 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:47,924 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 61 states, 61 states have (on average 153.0) internal successors, (9333), 61 states have internal predecessors, (9333), 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:47,926 INFO L81 ComplementDD]: Finished complementDD. Result has 61 states, 61 states have (on average 153.0) internal successors, (9333), 61 states have internal predecessors, (9333), 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:47,927 INFO L186 Difference]: Start difference. First operand has 224 places, 236 transitions, 1195 flow. Second operand 60 states and 4438 transitions. [2022-01-19 14:28:47,927 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 277 places, 731 transitions, 5088 flow [2022-01-19 14:28:48,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 259 places, 731 transitions, 5024 flow, removed 20 selfloop flow, removed 18 redundant places. [2022-01-19 14:28:48,107 INFO L242 Difference]: Finished difference. Result has 293 places, 391 transitions, 2960 flow [2022-01-19 14:28:48,108 INFO L317 CegarLoopForPetriNet]: {PETRI_ALPHABET=153, PETRI_DIFFERENCE_MINUEND_FLOW=1155, PETRI_DIFFERENCE_MINUEND_PLACES=200, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=236, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=140, PETRI_DIFFERENCE_SUBTRAHEND_STATES=60, PETRI_FLOW=2960, PETRI_PLACES=293, PETRI_TRANSITIONS=391} [2022-01-19 14:28:48,108 INFO L334 CegarLoopForPetriNet]: 137 programPoint places, 156 predicate places. [2022-01-19 14:28:48,108 INFO L470 AbstractCegarLoop]: Abstraction has has 293 places, 391 transitions, 2960 flow [2022-01-19 14:28:48,110 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 69.25581395348837) internal successors, (2978), 43 states have internal predecessors, (2978), 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:48,110 INFO L246 CegarLoopForPetriNet]: Found error trace [2022-01-19 14:28:48,110 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:48,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-01-19 14:28:48,310 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:28:48,311 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:28:48,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-19 14:28:48,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1704370966, now seen corresponding path program 3 times [2022-01-19 14:28:48,311 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-19 14:28:48,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235863402] [2022-01-19 14:28:48,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-19 14:28:48,311 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-19 14:28:48,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-19 14:28:49,030 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:49,031 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-19 14:28:49,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235863402] [2022-01-19 14:28:49,031 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235863402] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-19 14:28:49,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [691621425] [2022-01-19 14:28:49,031 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-19 14:28:49,031 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-19 14:28:49,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-19 14:28:49,032 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:28:49,033 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:28:49,107 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-19 14:28:49,107 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-19 14:28:49,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 52 conjunts are in the unsatisfiable core [2022-01-19 14:28:49,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-19 14:28:49,845 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:28:50,256 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:50,373 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:50,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-19 14:28:50,934 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:51,140 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:28:51,140 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 43 [2022-01-19 14:28:51,578 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:51,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-19 14:28:51,841 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0)))) (or (forall ((v_ArrVal_233 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0)) (= c_~min2~0 c_~min1~0)))) is different from false [2022-01-19 14:28:51,998 WARN L838 $PredicateComparison]: unable to prove that (or (let ((.cse3 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))))) (let ((.cse1 (forall ((v_ArrVal_233 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (.cse2 (< .cse3 c_~min1~0))) (and (or (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse0 c_~min2~0)) (= c_~min1~0 .cse0)))) (or .cse1 (= c_~min2~0 c_~min1~0))) .cse2) (or (and (or (= c_~min2~0 .cse3) .cse1) (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse4 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse4 c_~min2~0)) (= (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset (* c_thread1Thread1of1ForFork2_~i~0 4))) .cse4))))) (not .cse2))))) (<= (+ 2 c_~M~0) c_~N~0)) is different from false [2022-01-19 14:28:52,074 WARN L838 $PredicateComparison]: unable to prove that (or (<= (+ 2 c_~M~0) c_~N~0) (let ((.cse4 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (let ((.cse2 (forall ((v_ArrVal_233 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))) c_~min2~0))) (.cse0 (< .cse4 c_~min1~0))) (and (or .cse0 (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse1 c_~min2~0)) (= c_~min1~0 .cse1)))) (or .cse2 (= c_~min2~0 c_~min1~0)))) (or (and (forall ((v_ArrVal_233 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_233) c_~A~0.base) (+ c_~A~0.offset (* 4 c_~M~0))))) (or (not (< .cse3 c_~min2~0)) (= (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset) .cse3)))) (or .cse2 (= c_~min2~0 .cse4))) (not .cse0)))))) is different from false [2022-01-19 14:29:06,892 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:06,893 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:29:06,923 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:06,924 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 2613 treesize of output 2449 [2022-01-19 14:29:06,958 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:06,958 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 2404 treesize of output 2377 [2022-01-19 14:29:06,981 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 2364 treesize of output 2340 [2022-01-19 14:29:07,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:07,013 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 2340 treesize of output 2333 [2022-01-19 14:29:07,035 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 2320 treesize of output 2272 [2022-01-19 14:29:07,058 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 2272 treesize of output 2032 [2022-01-19 14:29:07,091 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:07,092 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 2032 treesize of output 1829 [2022-01-19 14:29:07,125 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-19 14:29:07,126 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 1816 treesize of output 1721 [2022-01-19 14:29:07,150 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 1708 treesize of output 1660 [2022-01-19 14:29:07,168 INFO L884 QuantifierPusher]: Run 10 iterations of DualJunctionQuantifierElimination maybe there is a nontermination bug. [2022-01-19 14:29:07,171 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-19 14:29:07,193 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:29:07,393 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:29:07,394 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.transform(TermContextTransformationEngine.java:65) 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:29:07,396 INFO L158 Benchmark]: Toolchain (without parser) took 67381.38ms. Allocated memory was 373.3MB in the beginning and 1.0GB in the end (delta: 652.2MB). Free memory was 318.0MB in the beginning and 474.4MB in the end (delta: -156.4MB). Peak memory consumption was 498.9MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,396 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 335.3MB. There was no memory consumed. Max. memory is 16.0GB. [2022-01-19 14:29:07,397 INFO L158 Benchmark]: CACSL2BoogieTranslator took 251.84ms. Allocated memory is still 373.3MB. Free memory was 317.7MB in the beginning and 342.9MB in the end (delta: -25.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,397 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.35ms. Allocated memory is still 373.3MB. Free memory was 342.9MB in the beginning and 341.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,397 INFO L158 Benchmark]: Boogie Preprocessor took 43.75ms. Allocated memory is still 373.3MB. Free memory was 341.0MB in the beginning and 339.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,397 INFO L158 Benchmark]: RCFGBuilder took 405.43ms. Allocated memory is still 373.3MB. Free memory was 339.7MB in the beginning and 320.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,397 INFO L158 Benchmark]: TraceAbstraction took 66629.23ms. Allocated memory was 373.3MB in the beginning and 1.0GB in the end (delta: 652.2MB). Free memory was 320.8MB in the beginning and 474.4MB in the end (delta: -153.6MB). Peak memory consumption was 500.6MB. Max. memory is 16.0GB. [2022-01-19 14:29:07,399 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 373.3MB. Free memory is still 335.3MB. There was no memory consumed. Max. memory is 16.0GB. * CACSL2BoogieTranslator took 251.84ms. Allocated memory is still 373.3MB. Free memory was 317.7MB in the beginning and 342.9MB in the end (delta: -25.2MB). Peak memory consumption was 10.9MB. Max. memory is 16.0GB. * Boogie Procedure Inliner took 45.35ms. Allocated memory is still 373.3MB. Free memory was 342.9MB in the beginning and 341.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * Boogie Preprocessor took 43.75ms. Allocated memory is still 373.3MB. Free memory was 341.0MB in the beginning and 339.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.0GB. * RCFGBuilder took 405.43ms. Allocated memory is still 373.3MB. Free memory was 339.7MB in the beginning and 320.8MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.0GB. * TraceAbstraction took 66629.23ms. Allocated memory was 373.3MB in the beginning and 1.0GB in the end (delta: 652.2MB). Free memory was 320.8MB in the beginning and 474.4MB in the end (delta: -153.6MB). Peak memory consumption was 500.6MB. 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:29:07,423 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...